/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:59:58,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:59:58,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:59:58,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:59:58,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:59:58,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:59:58,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:59:58,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:59:58,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:59:58,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:59:58,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:59:58,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:59:58,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:59:58,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:59:58,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:59:58,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:59:58,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:59:58,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:59:58,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:59:58,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:59:58,793 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:59:58,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:59:58,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:59:58,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:59:58,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:59:58,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:59:58,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:59:58,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:59:58,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:59:58,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:59:58,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:59:58,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:59:58,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:59:58,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:59:58,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:59:58,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:59:58,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:59:58,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:59:58,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:59:58,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:59:58,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:59:58,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:59:58,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 13:59:58,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:59:58,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:59:58,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:59:58,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:59:58,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:59:58,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:59:58,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:59:58,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:59:58,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:59:58,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:59:58,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:59:58,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:59:58,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:59:58,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:59:58,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:59:58,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:59:58,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:59:58,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:59:58,827 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:59:58,827 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:59:58,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:59:58,827 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:59:58,827 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 13:59:59,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:59:59,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:59:59,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:59:59,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:59:59,063 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:59:59,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound50.c [2022-04-28 13:59:59,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa8768b5/c7cc8810de55462eb7866a4fe7bc5e25/FLAG48ff2d42b [2022-04-28 13:59:59,461 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:59:59,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound50.c [2022-04-28 13:59:59,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa8768b5/c7cc8810de55462eb7866a4fe7bc5e25/FLAG48ff2d42b [2022-04-28 13:59:59,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa8768b5/c7cc8810de55462eb7866a4fe7bc5e25 [2022-04-28 13:59:59,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:59:59,479 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:59:59,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:59:59,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:59:59,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:59:59,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402a91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59, skipping insertion in model container [2022-04-28 13:59:59,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:59:59,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:59:59,627 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/prod4br-ll_unwindbound50.c[524,537] [2022-04-28 13:59:59,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:59:59,677 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:59:59,688 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/prod4br-ll_unwindbound50.c[524,537] [2022-04-28 13:59:59,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:59:59,705 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:59:59,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59 WrapperNode [2022-04-28 13:59:59,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:59:59,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:59:59,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:59:59,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:59:59,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:59:59,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:59:59,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:59:59,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:59:59,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (1/1) ... [2022-04-28 13:59:59,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:59:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:59:59,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 13:59:59,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 13:59:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:59:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:59:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:59:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:59:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:59:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:59:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:59:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:59:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:59:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:59:59,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:59:59,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:59:59,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:59:59,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:59:59,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:59:59,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:59:59,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:59:59,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:59:59,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:59:59,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:59:59,862 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:59:59,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:00:00,065 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:00:00,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:00:00,071 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:00:00,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:00:00 BoogieIcfgContainer [2022-04-28 14:00:00,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:00:00,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:00:00,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:00:00,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:00:00,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:59:59" (1/3) ... [2022-04-28 14:00:00,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a10dae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:00:00, skipping insertion in model container [2022-04-28 14:00:00,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:59:59" (2/3) ... [2022-04-28 14:00:00,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a10dae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:00:00, skipping insertion in model container [2022-04-28 14:00:00,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:00:00" (3/3) ... [2022-04-28 14:00:00,080 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound50.c [2022-04-28 14:00:00,091 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:00:00,091 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:00:00,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:00:00,134 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4300aec5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2131f9d1 [2022-04-28 14:00:00,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:00:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:00:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:00:00,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:00,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:00:00,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 1 times [2022-04-28 14:00:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:00,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1355651924] [2022-04-28 14:00:00,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:00:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 2 times [2022-04-28 14:00:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721028056] [2022-04-28 14:00:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:00:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:00,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-28 14:00:00,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 14:00:00,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 14:00:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:00:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:00,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 14:00:00,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 14:00:00,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 14:00:00,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 14:00:00,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:00:00,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-28 14:00:00,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 14:00:00,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 14:00:00,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-28 14:00:00,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID [2022-04-28 14:00:00,378 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-28 14:00:00,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 14:00:00,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 14:00:00,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 14:00:00,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 14:00:00,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36#false} is VALID [2022-04-28 14:00:00,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-28 14:00:00,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36#false} is VALID [2022-04-28 14:00:00,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 14:00:00,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 14:00:00,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 14:00:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721028056] [2022-04-28 14:00:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721028056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:00,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:00,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:00:00,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:00,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1355651924] [2022-04-28 14:00:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1355651924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:00,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:00:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685360547] [2022-04-28 14:00:00,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:00:00,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:00,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:00,431 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-28 14:00:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:00:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:00:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:00:00,469 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:00,613 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-04-28 14:00:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:00:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:00:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 14:00:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 14:00:00,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-28 14:00:00,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:00,718 INFO L225 Difference]: With dead ends: 56 [2022-04-28 14:00:00,718 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 14:00:00,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:00:00,723 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:00,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:00:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 14:00:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 14:00:00,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:00,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:00,757 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:00,757 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:00,762 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 14:00:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 14:00:00,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:00,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:00,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 14:00:00,763 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 14:00:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:00,767 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 14:00:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 14:00:00,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:00,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:00,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:00,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 14:00:00,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-04-28 14:00:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:00,773 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 14:00:00,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:00,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-28 14:00:00,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 14:00:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:00:00,809 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:00,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:00:00,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:00:00,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 1 times [2022-04-28 14:00:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:00,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715119159] [2022-04-28 14:00:00,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:00:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 2 times [2022-04-28 14:00:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358515936] [2022-04-28 14:00:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:00,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111299678] [2022-04-28 14:00:00,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:00,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:00:00,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:00:00,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:00:00,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:00,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:00:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:00,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:01,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-28 14:00:01,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#(<= ~counter~0 0)} {269#true} #77#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#(<= ~counter~0 0)} call #t~ret7 := main(); {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(<= ~counter~0 0)} ~cond := #in~cond; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(<= ~counter~0 0)} assume !(0 == ~cond); {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(<= ~counter~0 0)} {277#(<= ~counter~0 0)} #69#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 14:00:01,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {311#(<= |main_#t~post6| 0)} is VALID [2022-04-28 14:00:01,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {270#false} is VALID [2022-04-28 14:00:01,089 INFO L272 TraceCheckUtils]: 14: Hoare triple {270#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {270#false} is VALID [2022-04-28 14:00:01,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-28 14:00:01,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-28 14:00:01,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-28 14:00:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:01,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:00:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:01,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358515936] [2022-04-28 14:00:01,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:01,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111299678] [2022-04-28 14:00:01,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111299678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:01,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:01,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:00:01,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:01,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715119159] [2022-04-28 14:00:01,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715119159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:01,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:01,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:00:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251862900] [2022-04-28 14:00:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:01,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:00:01,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:01,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:00:01,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:01,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:00:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:01,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:00:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:00:01,119 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:00:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:01,217 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 14:00:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:00:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:00:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:00:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 14:00:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:00:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 14:00:01,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-28 14:00:01,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:01,294 INFO L225 Difference]: With dead ends: 37 [2022-04-28 14:00:01,294 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 14:00:01,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:00:01,295 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:01,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:00:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 14:00:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 14:00:01,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:01,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:01,315 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:01,315 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:01,319 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 14:00:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 14:00:01,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:01,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:01,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 14:00:01,323 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 14:00:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:01,327 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 14:00:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 14:00:01,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:01,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:01,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:01,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:00:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 14:00:01,335 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-04-28 14:00:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 14:00:01,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:00:01,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 14:00:01,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 14:00:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:00:01,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:01,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:00:01,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 14:00:01,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:01,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 1 times [2022-04-28 14:00:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:01,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645620633] [2022-04-28 14:00:01,594 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:00:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 2 times [2022-04-28 14:00:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351212814] [2022-04-28 14:00:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:01,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:01,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101772238] [2022-04-28 14:00:01,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:01,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:01,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:00:01,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:00:01,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:00:01,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:01,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:00:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:01,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:01,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2022-04-28 14:00:01,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {516#true} is VALID [2022-04-28 14:00:01,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 14:00:01,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #77#return; {516#true} is VALID [2022-04-28 14:00:01,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret7 := main(); {516#true} is VALID [2022-04-28 14:00:01,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {516#true} is VALID [2022-04-28 14:00:01,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {516#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {516#true} is VALID [2022-04-28 14:00:01,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#true} ~cond := #in~cond; {516#true} is VALID [2022-04-28 14:00:01,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#true} assume !(0 == ~cond); {516#true} is VALID [2022-04-28 14:00:01,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 14:00:01,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {516#true} {516#true} #69#return; {516#true} is VALID [2022-04-28 14:00:01,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:01,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:01,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:00:01,863 INFO L272 TraceCheckUtils]: 14: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:01,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:01,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {517#false} is VALID [2022-04-28 14:00:01,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#false} assume !false; {517#false} is VALID [2022-04-28 14:00:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:01,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:00:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:01,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351212814] [2022-04-28 14:00:01,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:01,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101772238] [2022-04-28 14:00:01,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101772238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:01,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:01,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:00:01,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645620633] [2022-04-28 14:00:01,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645620633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:01,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:01,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:00:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327731256] [2022-04-28 14:00:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:01,867 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:00:01,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:01,868 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:01,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:01,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:00:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:00:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:00:01,883 INFO L87 Difference]: Start difference. First operand 29 states and 35 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:02,084 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-28 14:00:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:00:02,084 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:00:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:02,085 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 14:00:02,087 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 14:00:02,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 14:00:02,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:02,142 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:00:02,142 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 14:00:02,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:00:02,143 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:02,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:00:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 14:00:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-28 14:00:02,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:02,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:00:02,160 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:00:02,161 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:00:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:02,163 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 14:00:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 14:00:02,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:02,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:02,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 14:00:02,165 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 14:00:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:02,167 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 14:00:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 14:00:02,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:02,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:02,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:02,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:00:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-28 14:00:02,170 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2022-04-28 14:00:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:02,170 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-28 14:00:02,171 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:00:02,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-28 14:00:02,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-28 14:00:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:00:02,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:00:02,208 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:00:02,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:00:02,419 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,SelfDestructingSolverStorable2 [2022-04-28 14:00:02,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:00:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:00:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 1 times [2022-04-28 14:00:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:02,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054086616] [2022-04-28 14:00:02,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:00:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 2 times [2022-04-28 14:00:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:00:02,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538797732] [2022-04-28 14:00:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:00:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:00:02,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:00:02,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082389682] [2022-04-28 14:00:02,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:00:02,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:00:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:00:02,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:00:02,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:00:02,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:00:02,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:00:02,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:00:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:00:02,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:00:13,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 14:00:13,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-28 14:00:13,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 14:00:13,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 14:00:13,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 14:00:13,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 14:00:13,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 14:00:13,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:00:13,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:00:13,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:00:13,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#(not (= |assume_abort_if_not_#in~cond| 0))} {808#true} #69#return; {845#(<= 1 main_~y~0)} is VALID [2022-04-28 14:00:13,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:00:13,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:00:13,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(#t~post6 < 50);havoc #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 14:00:13,017 INFO L272 TraceCheckUtils]: 14: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 14:00:13,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:13,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:13,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:15,029 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #71#return; {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 14:00:15,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 14:00:15,031 INFO L272 TraceCheckUtils]: 20: Hoare triple {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:15,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:15,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 14:00:15,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 14:00:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:15,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:00:51,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 14:00:51,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 14:00:51,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:00:51,932 INFO L272 TraceCheckUtils]: 20: Hoare triple {901#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:00:51,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {901#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:00:51,935 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {808#true} #71#return; {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:00:51,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:51,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:00:51,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:00:51,937 INFO L272 TraceCheckUtils]: 14: Hoare triple {808#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 14:00:51,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#true} assume !!(#t~post6 < 50);havoc #t~post6; {808#true} is VALID [2022-04-28 14:00:51,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {808#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {808#true} is VALID [2022-04-28 14:00:51,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {808#true} is VALID [2022-04-28 14:00:51,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {808#true} {808#true} #69#return; {808#true} is VALID [2022-04-28 14:00:51,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 14:00:51,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#true} assume !(0 == ~cond); {808#true} is VALID [2022-04-28 14:00:51,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {808#true} is VALID [2022-04-28 14:00:51,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 14:00:51,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 14:00:51,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 14:00:51,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 14:00:51,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 14:00:51,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-28 14:00:51,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 14:00:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:00:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:00:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538797732] [2022-04-28 14:00:51,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:00:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082389682] [2022-04-28 14:00:51,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082389682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:00:51,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:00:51,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 14:00:51,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:00:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054086616] [2022-04-28 14:00:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054086616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:00:51,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:00:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:00:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146116539] [2022-04-28 14:00:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:00:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 14:00:51,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:00:51,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:53,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:53,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:00:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:00:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:00:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:00:53,974 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:56,102 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 14:00:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:00:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 14:00:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:00:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 14:00:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 14:00:56,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 14:00:58,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:00:58,172 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:00:58,172 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 14:00:58,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:00:58,174 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:00:58,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 14:00:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 14:00:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-04-28 14:00:58,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:00:58,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:00:58,220 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:00:58,220 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:00:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:58,222 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 14:00:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 14:00:58,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:58,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:58,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 14:00:58,224 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 14:00:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:00:58,226 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 14:00:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 14:00:58,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:00:58,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:00:58,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:00:58,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:00:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:00:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-28 14:00:58,229 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 24 [2022-04-28 14:00:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:00:58,230 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-28 14:00:58,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:00:58,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-28 14:01:00,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 14:01:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:01:00,290 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:00,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:00,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:01:00,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:00,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 1 times [2022-04-28 14:01:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:00,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102508210] [2022-04-28 14:01:06,597 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:06,597 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 2 times [2022-04-28 14:01:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:06,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685029385] [2022-04-28 14:01:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:06,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:06,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421996989] [2022-04-28 14:01:06,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:06,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:06,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:06,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:06,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:01:06,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:06,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:06,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:01:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:06,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:06,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 14:01:06,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#(<= ~counter~0 0)} {1260#true} #77#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#(<= ~counter~0 0)} call #t~ret7 := main(); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {1268#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= ~counter~0 0)} ~cond := #in~cond; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(<= ~counter~0 0)} assume !(0 == ~cond); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1268#(<= ~counter~0 0)} {1268#(<= ~counter~0 0)} #69#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 14:01:06,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,872 INFO L272 TraceCheckUtils]: 14: Hoare triple {1302#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(<= ~counter~0 1)} ~cond := #in~cond; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= ~counter~0 1)} assume !(0 == ~cond); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= ~counter~0 1)} assume true; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,874 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1302#(<= ~counter~0 1)} {1302#(<= ~counter~0 1)} #71#return; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 14:01:06,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1330#(<= |main_#t~post6| 1)} is VALID [2022-04-28 14:01:06,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {1330#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1261#false} is VALID [2022-04-28 14:01:06,876 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 14:01:06,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 14:01:06,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 14:01:06,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 14:01:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:06,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:01:07,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 14:01:07,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 14:01:07,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 14:01:07,029 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 14:01:07,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {1358#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1261#false} is VALID [2022-04-28 14:01:07,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1358#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:01:07,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1362#(< ~counter~0 50)} is VALID [2022-04-28 14:01:07,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {1362#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {1362#(< ~counter~0 50)} is VALID [2022-04-28 14:01:07,031 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1260#true} {1362#(< ~counter~0 50)} #71#return; {1362#(< ~counter~0 50)} is VALID [2022-04-28 14:01:07,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 14:01:07,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 14:01:07,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 14:01:07,032 INFO L272 TraceCheckUtils]: 14: Hoare triple {1362#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1260#true} is VALID [2022-04-28 14:01:07,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {1362#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1362#(< ~counter~0 50)} is VALID [2022-04-28 14:01:07,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1390#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1362#(< ~counter~0 50)} is VALID [2022-04-28 14:01:07,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(< ~counter~0 49)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1260#true} {1390#(< ~counter~0 49)} #69#return; {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 14:01:07,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 14:01:07,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 14:01:07,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {1390#(< ~counter~0 49)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1260#true} is VALID [2022-04-28 14:01:07,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#(< ~counter~0 49)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#(< ~counter~0 49)} call #t~ret7 := main(); {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#(< ~counter~0 49)} {1260#true} #77#return; {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#(< ~counter~0 49)} assume true; {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#(< ~counter~0 49)} is VALID [2022-04-28 14:01:07,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 14:01:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:01:07,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685029385] [2022-04-28 14:01:07,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:01:07,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421996989] [2022-04-28 14:01:07,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421996989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:01:07,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:01:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:01:07,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:01:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102508210] [2022-04-28 14:01:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102508210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:01:07,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:01:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:01:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947753405] [2022-04-28 14:01:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:01:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 14:01:07,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:01:07,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:01:07,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:01:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:01:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:01:07,062 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:01:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:07,250 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-28 14:01:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:01:07,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 14:01:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:01:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:01:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 14:01:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:01:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 14:01:07,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-28 14:01:07,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:07,303 INFO L225 Difference]: With dead ends: 73 [2022-04-28 14:01:07,303 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 14:01:07,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:01:07,304 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:01:07,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:01:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 14:01:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-28 14:01:07,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:01:07,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:07,383 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:07,384 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:07,386 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 14:01:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 14:01:07,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:07,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:07,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 14:01:07,388 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 14:01:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:01:07,390 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 14:01:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 14:01:07,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:01:07,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:01:07,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:01:07,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:01:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:01:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-04-28 14:01:07,393 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2022-04-28 14:01:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:01:07,394 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-04-28 14:01:07,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:01:07,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 76 transitions. [2022-04-28 14:01:09,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:01:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 14:01:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:01:09,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:01:09,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:01:09,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 14:01:09,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:09,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:01:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:01:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 1 times [2022-04-28 14:01:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:01:09,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591511229] [2022-04-28 14:01:15,741 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:01:15,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:01:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 2 times [2022-04-28 14:01:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:01:15,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584707405] [2022-04-28 14:01:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:01:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:01:15,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:01:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929651128] [2022-04-28 14:01:15,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:01:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:01:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:01:15,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:01:15,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:01:15,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:01:15,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:01:15,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:01:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:01:15,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:01:16,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 14:01:16,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1825#true} is VALID [2022-04-28 14:01:16,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 14:01:16,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-28 14:01:16,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-28 14:01:16,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-28 14:01:16,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-28 14:01:16,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-28 14:01:16,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-28 14:01:16,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 14:01:16,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-28 14:01:16,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:16,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:16,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:16,295 INFO L272 TraceCheckUtils]: 14: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-28 14:01:16,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:16,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:16,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:01:16,298 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:16,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:01:16,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:01:16,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:01:16,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 14:01:16,305 INFO L272 TraceCheckUtils]: 23: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:01:16,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:01:16,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 14:01:16,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 14:01:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:01:16,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:02:11,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 14:02:11,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 14:02:11,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:11,667 INFO L272 TraceCheckUtils]: 23: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:11,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 50);havoc #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:11,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:11,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:11,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:02:11,677 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1825#true} #71#return; {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 14:02:11,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:11,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:11,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:02:11,678 INFO L272 TraceCheckUtils]: 14: Hoare triple {1825#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {1825#true} assume !!(#t~post6 < 50);havoc #t~post6; {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {1825#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-28 14:02:11,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1825#true} is VALID [2022-04-28 14:02:11,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 14:02:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:02:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:11,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584707405] [2022-04-28 14:02:11,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:11,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929651128] [2022-04-28 14:02:11,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929651128] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:02:11,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:02:11,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 14:02:11,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:11,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591511229] [2022-04-28 14:02:11,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591511229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:11,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:11,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:02:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954665826] [2022-04-28 14:02:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 14:02:11,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:11,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:11,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:02:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:02:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:02:11,713 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:12,380 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 14:02:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:02:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 14:02:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 14:02:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 14:02:12,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-28 14:02:12,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:12,452 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:02:12,452 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 14:02:12,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:02:12,453 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:12,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:02:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 14:02:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2022-04-28 14:02:12,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:12,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:12,527 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:12,527 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:12,533 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 14:02:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:02:12,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:12,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:12,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 14:02:12,536 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 14:02:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:12,541 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 14:02:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 14:02:12,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:12,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:12,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:12,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-28 14:02:12,545 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 27 [2022-04-28 14:02:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:12,545 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-28 14:02:12,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:12,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-28 14:02:14,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-28 14:02:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:02:14,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:14,661 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:02:14,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 14:02:14,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:14,862 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 1 times [2022-04-28 14:02:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:14,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220767914] [2022-04-28 14:02:14,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:02:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 2 times [2022-04-28 14:02:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:14,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156423296] [2022-04-28 14:02:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:14,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:14,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631665643] [2022-04-28 14:02:14,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:14,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:14,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:14,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:14,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:02:14,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:14,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:14,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:02:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:14,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:15,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {2438#true} call ULTIMATE.init(); {2438#true} is VALID [2022-04-28 14:02:15,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {2438#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2438#true} is VALID [2022-04-28 14:02:15,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 14:02:15,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2438#true} {2438#true} #77#return; {2438#true} is VALID [2022-04-28 14:02:15,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {2438#true} call #t~ret7 := main(); {2438#true} is VALID [2022-04-28 14:02:15,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {2438#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2438#true} is VALID [2022-04-28 14:02:15,112 INFO L272 TraceCheckUtils]: 6: Hoare triple {2438#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2438#true} is VALID [2022-04-28 14:02:15,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#true} ~cond := #in~cond; {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:02:15,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:15,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:02:15,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} {2438#true} #69#return; {2475#(<= 1 main_~y~0)} is VALID [2022-04-28 14:02:15,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:15,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {2479#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:15,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:15,115 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-28 14:02:15,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-28 14:02:15,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-28 14:02:15,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 14:02:15,116 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2438#true} {2479#(<= 1 main_~b~0)} #71#return; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 14:02:15,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {2479#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:15,116 INFO L272 TraceCheckUtils]: 20: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-28 14:02:15,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-28 14:02:15,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-28 14:02:15,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 14:02:15,122 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2438#true} {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} #73#return; {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 14:02:15,122 INFO L272 TraceCheckUtils]: 25: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:15,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:15,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {2527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2439#false} is VALID [2022-04-28 14:02:15,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {2439#false} assume !false; {2439#false} is VALID [2022-04-28 14:02:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:02:15,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:02:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:15,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156423296] [2022-04-28 14:02:15,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631665643] [2022-04-28 14:02:15,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631665643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:15,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:15,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:02:15,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220767914] [2022-04-28 14:02:15,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220767914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:15,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:15,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:02:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447751522] [2022-04-28 14:02:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-28 14:02:15,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:15,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:02:15,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:15,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:02:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:15,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:02:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:02:15,149 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:02:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:15,570 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-28 14:02:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:02:15,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-28 14:02:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:02:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 14:02:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:02:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 14:02:15,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 14:02:15,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:15,649 INFO L225 Difference]: With dead ends: 85 [2022-04-28 14:02:15,649 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 14:02:15,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:02:15,651 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:15,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:02:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 14:02:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-04-28 14:02:15,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:15,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:15,727 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:15,727 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:15,729 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 14:02:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 14:02:15,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:15,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:15,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:02:15,730 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 14:02:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:15,732 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 14:02:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 14:02:15,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:15,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:15,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:15,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:02:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-04-28 14:02:15,735 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 29 [2022-04-28 14:02:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:15,735 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-04-28 14:02:15,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:02:15,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 80 transitions. [2022-04-28 14:02:17,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-04-28 14:02:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:02:17,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:17,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:02:17,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:02:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:18,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 1 times [2022-04-28 14:02:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460136989] [2022-04-28 14:02:24,108 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:02:24,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:02:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 2 times [2022-04-28 14:02:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087049300] [2022-04-28 14:02:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:24,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698211400] [2022-04-28 14:02:24,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:24,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:24,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:24,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:02:24,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:24,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:24,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:02:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:24,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:24,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-28 14:02:24,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2965#true} is VALID [2022-04-28 14:02:24,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:02:24,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-28 14:02:24,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-28 14:02:24,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-28 14:02:24,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:02:24,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-28 14:02:24,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-28 14:02:24,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:02:24,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-28 14:02:24,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,446 INFO L272 TraceCheckUtils]: 14: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:02:24,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} ~cond := #in~cond; {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:24,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:24,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:24,448 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-28 14:02:24,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:24,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:24,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-28 14:02:24,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-28 14:02:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:02:24,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:02:46,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-28 14:02:46,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-28 14:02:46,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:46,108 INFO L272 TraceCheckUtils]: 24: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:46,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 50);havoc #t~post6; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:46,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:46,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:46,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:46,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:46,120 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {2965#true} #71#return; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:02:46,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:46,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {3094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:46,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} ~cond := #in~cond; {3094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:02:46,121 INFO L272 TraceCheckUtils]: 14: Hoare triple {2965#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:02:46,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {2965#true} assume !!(#t~post6 < 50);havoc #t~post6; {2965#true} is VALID [2022-04-28 14:02:46,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {2965#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2965#true} is VALID [2022-04-28 14:02:46,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2965#true} is VALID [2022-04-28 14:02:46,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-28 14:02:46,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 14:02:46,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2965#true} is VALID [2022-04-28 14:02:46,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-28 14:02:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:02:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:02:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087049300] [2022-04-28 14:02:46,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:02:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698211400] [2022-04-28 14:02:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698211400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:02:46,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:02:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-04-28 14:02:46,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:02:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460136989] [2022-04-28 14:02:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460136989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:02:46,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:02:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:02:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556597017] [2022-04-28 14:02:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:02:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 14:02:46,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:02:46,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:46,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:46,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:02:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:02:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:02:46,149 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:46,671 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 14:02:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:02:46,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 14:02:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:02:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 14:02:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 14:02:46,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-28 14:02:46,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:46,745 INFO L225 Difference]: With dead ends: 73 [2022-04-28 14:02:46,745 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 14:02:46,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:02:46,746 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:02:46,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:02:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 14:02:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-28 14:02:46,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:02:46,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:46,819 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:46,819 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:46,822 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-28 14:02:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-28 14:02:46,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:46,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:46,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-28 14:02:46,823 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-28 14:02:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:02:46,825 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-28 14:02:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-28 14:02:46,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:02:46,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:02:46,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:02:46,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:02:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:02:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-28 14:02:46,828 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 28 [2022-04-28 14:02:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:02:46,828 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-28 14:02:46,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:02:46,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-28 14:02:48,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 84 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:02:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-28 14:02:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:02:48,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:02:48,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:02:48,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:02:49,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:49,132 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:02:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:02:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 1 times [2022-04-28 14:02:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:02:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412958625] [2022-04-28 14:02:55,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:02:55,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:02:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 2 times [2022-04-28 14:02:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:02:55,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785519300] [2022-04-28 14:02:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:02:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:02:55,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:02:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607065855] [2022-04-28 14:02:55,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:02:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:02:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:02:55,209 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:02:55,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:02:55,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:02:55,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:02:55,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 14:02:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:02:55,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:02:55,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-28 14:02:55,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-28 14:02:55,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:02:55,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #77#return; {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret7 := main(); {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:02:55,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #69#return; {3568#true} is VALID [2022-04-28 14:02:55,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {3568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,557 INFO L272 TraceCheckUtils]: 14: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:02:55,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {3568#true} ~cond := #in~cond; {3619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:55,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:55,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:02:55,559 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-28 14:02:55,566 INFO L272 TraceCheckUtils]: 25: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:02:55,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:02:55,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {3656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3569#false} is VALID [2022-04-28 14:02:55,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-28 14:02:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:02:55,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:03:06,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-28 14:03:06,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {3656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3569#false} is VALID [2022-04-28 14:03:06,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:06,823 INFO L272 TraceCheckUtils]: 25: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:06,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 50);havoc #t~post6; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:06,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:06,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:06,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:03:06,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:03:06,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:03:06,833 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} {3568#true} #71#return; {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-28 14:03:06,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:06,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {3704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:06,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {3568#true} ~cond := #in~cond; {3704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:03:06,835 INFO L272 TraceCheckUtils]: 14: Hoare triple {3568#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !!(#t~post6 < 50);havoc #t~post6; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {3568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #69#return; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret7 := main(); {3568#true} is VALID [2022-04-28 14:03:06,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #77#return; {3568#true} is VALID [2022-04-28 14:03:06,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 14:03:06,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-28 14:03:06,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-28 14:03:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:03:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:03:06,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785519300] [2022-04-28 14:03:06,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:03:06,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607065855] [2022-04-28 14:03:06,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607065855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:03:06,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:03:06,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 14:03:06,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:03:06,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412958625] [2022-04-28 14:03:06,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412958625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:06,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:06,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:03:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127899453] [2022-04-28 14:03:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:03:06,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:03:06,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:03:06,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:06,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:06,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:03:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:06,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:03:06,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:03:06,862 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:07,744 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-04-28 14:03:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:03:07,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 14:03:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 14:03:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 14:03:07,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 14:03:07,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:07,822 INFO L225 Difference]: With dead ends: 95 [2022-04-28 14:03:07,822 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 14:03:07,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:03:07,822 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:07,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:03:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 14:03:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-28 14:03:07,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:07,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:07,909 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:07,910 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:07,912 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 14:03:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 14:03:07,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:07,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:07,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:03:07,913 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-28 14:03:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:07,915 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 14:03:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 14:03:07,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:07,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:07,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:07,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-04-28 14:03:07,919 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 29 [2022-04-28 14:03:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:07,919 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-04-28 14:03:07,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:07,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 97 transitions. [2022-04-28 14:03:10,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-28 14:03:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:03:10,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:03:10,037 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:03:10,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:03:10,238 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,SelfDestructingSolverStorable8 [2022-04-28 14:03:10,238 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:03:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:03:10,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 1 times [2022-04-28 14:03:10,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:10,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460805946] [2022-04-28 14:03:16,288 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:03:16,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:03:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 2 times [2022-04-28 14:03:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:03:16,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532109167] [2022-04-28 14:03:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:03:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:03:16,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:03:16,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043406196] [2022-04-28 14:03:16,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:03:16,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:03:16,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:03:16,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:03:16,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 14:03:16,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:03:16,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:03:16,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:03:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:03:16,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:03:16,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #77#return; {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret7 := main(); {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {4260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:03:16,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:03:16,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4260#true} {4260#true} #69#return; {4260#true} is VALID [2022-04-28 14:03:16,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,596 INFO L272 TraceCheckUtils]: 14: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:03:16,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:03:16,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:03:16,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:03:16,597 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4260#true} {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 14:03:16,605 INFO L272 TraceCheckUtils]: 25: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:16,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:16,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 14:03:16,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 14:03:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:03:16,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:03:16,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-28 14:03:16,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-28 14:03:16,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:16,756 INFO L272 TraceCheckUtils]: 25: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:16,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 50);havoc #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,763 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4260#true} {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #71#return; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:03:16,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:03:16,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:03:16,763 INFO L272 TraceCheckUtils]: 14: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:03:16,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 50);havoc #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:16,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4260#true} {4260#true} #69#return; {4260#true} is VALID [2022-04-28 14:03:16,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:03:16,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-28 14:03:16,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-28 14:03:16,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {4260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret7 := main(); {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #77#return; {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-28 14:03:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:03:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:03:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532109167] [2022-04-28 14:03:16,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:03:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043406196] [2022-04-28 14:03:16,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043406196] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:03:16,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:03:16,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:03:16,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:03:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460805946] [2022-04-28 14:03:16,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460805946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:16,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:16,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:03:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29268843] [2022-04-28 14:03:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:03:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-04-28 14:03:16,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:03:16,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:16,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:16,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:03:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:03:16,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:03:16,789 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:17,097 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 14:03:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:03:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-04-28 14:03:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:03:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:03:17,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 14:03:17,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:17,180 INFO L225 Difference]: With dead ends: 83 [2022-04-28 14:03:17,180 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 14:03:17,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:03:17,181 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:17,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:03:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 14:03:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 14:03:17,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:17,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:17,291 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:17,291 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:17,294 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 14:03:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:03:17,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:17,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:17,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-28 14:03:17,296 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-28 14:03:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:17,297 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 14:03:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:03:17,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:17,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:17,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:17,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:03:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-28 14:03:17,299 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2022-04-28 14:03:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:17,300 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-28 14:03:17,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:03:17,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 100 transitions. [2022-04-28 14:03:19,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 14:03:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 14:03:19,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:03:19,634 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:03:19,650 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-28 14:03:19,836 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,SelfDestructingSolverStorable9 [2022-04-28 14:03:19,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:03:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:03:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 1 times [2022-04-28 14:03:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:19,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187649884] [2022-04-28 14:03:23,906 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:03:23,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:03:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 2 times [2022-04-28 14:03:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:03:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650746441] [2022-04-28 14:03:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:03:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:03:23,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:03:23,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596838166] [2022-04-28 14:03:23,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:03:23,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:03:23,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:03:23,922 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:03:23,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 14:03:23,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:03:23,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:03:23,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 14:03:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:03:23,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:03:24,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {4932#true} call ULTIMATE.init(); {4932#true} is VALID [2022-04-28 14:03:24,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4932#true} is VALID [2022-04-28 14:03:24,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-28 14:03:24,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4932#true} {4932#true} #77#return; {4932#true} is VALID [2022-04-28 14:03:24,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {4932#true} call #t~ret7 := main(); {4932#true} is VALID [2022-04-28 14:03:24,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {4932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4932#true} is VALID [2022-04-28 14:03:24,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {4932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4932#true} is VALID [2022-04-28 14:03:24,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {4932#true} ~cond := #in~cond; {4958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:03:24,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {4958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:03:24,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {4962#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:03:24,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4962#(not (= |assume_abort_if_not_#in~cond| 0))} {4932#true} #69#return; {4969#(<= 1 main_~y~0)} is VALID [2022-04-28 14:03:24,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {4969#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:03:24,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {4973#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:03:24,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {4973#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:03:24,297 INFO L272 TraceCheckUtils]: 14: Hoare triple {4973#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4932#true} is VALID [2022-04-28 14:03:24,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {4932#true} ~cond := #in~cond; {4932#true} is VALID [2022-04-28 14:03:24,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {4932#true} assume !(0 == ~cond); {4932#true} is VALID [2022-04-28 14:03:24,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-28 14:03:24,297 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4932#true} {4973#(<= 1 main_~b~0)} #71#return; {4973#(<= 1 main_~b~0)} is VALID [2022-04-28 14:03:24,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {4973#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:03:24,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:03:24,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:03:24,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !!(#t~post6 < 50);havoc #t~post6; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:03:24,300 INFO L272 TraceCheckUtils]: 23: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4932#true} is VALID [2022-04-28 14:03:24,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {4932#true} ~cond := #in~cond; {4932#true} is VALID [2022-04-28 14:03:24,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {4932#true} assume !(0 == ~cond); {4932#true} is VALID [2022-04-28 14:03:24,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-28 14:03:24,301 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4932#true} {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #71#return; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 14:03:24,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4933#false} is VALID [2022-04-28 14:03:24,301 INFO L272 TraceCheckUtils]: 29: Hoare triple {4933#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4933#false} is VALID [2022-04-28 14:03:24,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {4933#false} ~cond := #in~cond; {4933#false} is VALID [2022-04-28 14:03:24,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {4933#false} assume 0 == ~cond; {4933#false} is VALID [2022-04-28 14:03:24,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {4933#false} assume !false; {4933#false} is VALID [2022-04-28 14:03:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:03:24,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:03:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:03:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650746441] [2022-04-28 14:03:24,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:03:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596838166] [2022-04-28 14:03:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596838166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:24,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:24,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:03:24,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:03:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [187649884] [2022-04-28 14:03:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [187649884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:03:24,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:03:24,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:03:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569345629] [2022-04-28 14:03:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:03:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 14:03:24,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:03:24,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:03:24,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:24,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:03:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:03:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:03:24,326 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:03:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:24,648 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-28 14:03:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:03:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 14:03:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:03:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:03:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 14:03:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:03:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 14:03:24,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 14:03:24,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:24,700 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:03:24,700 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 14:03:24,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:03:24,701 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:03:24,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:03:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 14:03:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-04-28 14:03:24,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:03:24,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:24,792 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:24,792 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:24,795 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 14:03:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 14:03:24,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:24,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:24,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-28 14:03:24,796 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-28 14:03:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:03:24,798 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 14:03:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 14:03:24,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:03:24,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:03:24,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:03:24,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:03:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:03:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2022-04-28 14:03:24,800 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 33 [2022-04-28 14:03:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:03:24,801 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-04-28 14:03:24,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:03:24,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 106 transitions. [2022-04-28 14:03:27,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:03:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-04-28 14:03:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:03:27,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:03:27,099 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:03:27,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 14:03:27,299 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,SelfDestructingSolverStorable10 [2022-04-28 14:03:27,300 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:03:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:03:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 1 times [2022-04-28 14:03:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:03:27,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1743836634] [2022-04-28 14:03:33,370 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:03:33,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:03:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 2 times [2022-04-28 14:03:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:03:33,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684961222] [2022-04-28 14:03:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:03:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:03:33,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:03:33,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725457987] [2022-04-28 14:03:33,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:03:33,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:03:33,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:03:33,392 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:03:33,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 14:03:33,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:03:33,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:03:33,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:03:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:03:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:03:43,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5587#true} is VALID [2022-04-28 14:03:43,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5587#true} is VALID [2022-04-28 14:03:43,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:03:43,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5587#true} {5587#true} #77#return; {5587#true} is VALID [2022-04-28 14:03:43,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {5587#true} call #t~ret7 := main(); {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {5587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {5587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5587#true} {5587#true} #69#return; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {5587#true} assume !!(#t~post6 < 50);havoc #t~post6; {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L272 TraceCheckUtils]: 14: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:03:43,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:03:43,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:03:43,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:03:43,606 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5587#true} {5587#true} #71#return; {5587#true} is VALID [2022-04-28 14:03:43,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:03:43,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {5649#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:03:43,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {5649#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:03:43,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {5649#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:03:43,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {5649#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:03:43,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {5649#(not (= main_~a~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {5649#(not (= main_~a~0 0))} is VALID [2022-04-28 14:03:43,609 INFO L272 TraceCheckUtils]: 25: Hoare triple {5649#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:03:43,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {5587#true} ~cond := #in~cond; {5671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:43,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {5671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:43,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:03:45,612 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} {5649#(not (= main_~a~0 0))} #71#return; {5682#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-28 14:03:45,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {5682#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:03:45,613 INFO L272 TraceCheckUtils]: 31: Hoare triple {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:03:45,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:03:45,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {5694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5588#false} is VALID [2022-04-28 14:03:45,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2022-04-28 14:03:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 14:03:45,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:04:12,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2022-04-28 14:04:12,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {5694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5588#false} is VALID [2022-04-28 14:04:12,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:12,180 INFO L272 TraceCheckUtils]: 31: Hoare triple {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:12,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {5713#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:12,182 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} {5587#true} #71#return; {5713#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:04:12,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:12,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {5726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:12,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {5587#true} ~cond := #in~cond; {5726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:04:12,183 INFO L272 TraceCheckUtils]: 25: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:04:12,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {5587#true} assume !!(#t~post6 < 50);havoc #t~post6; {5587#true} is VALID [2022-04-28 14:04:12,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {5587#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {5587#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {5587#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5587#true} {5587#true} #71#return; {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:04:12,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {5587#true} assume !!(#t~post6 < 50);havoc #t~post6; {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5587#true} {5587#true} #69#return; {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {5587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5587#true} is VALID [2022-04-28 14:04:12,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {5587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5587#true} is VALID [2022-04-28 14:04:12,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {5587#true} call #t~ret7 := main(); {5587#true} is VALID [2022-04-28 14:04:12,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5587#true} {5587#true} #77#return; {5587#true} is VALID [2022-04-28 14:04:12,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-28 14:04:12,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5587#true} is VALID [2022-04-28 14:04:12,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5587#true} is VALID [2022-04-28 14:04:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:04:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:04:12,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684961222] [2022-04-28 14:04:12,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:04:12,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725457987] [2022-04-28 14:04:12,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725457987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:04:12,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:04:12,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:04:12,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:04:12,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1743836634] [2022-04-28 14:04:12,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1743836634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:04:12,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:04:12,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:04:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444195755] [2022-04-28 14:04:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:04:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 35 [2022-04-28 14:04:12,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:04:12,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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-28 14:04:14,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:14,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:04:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:14,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:04:14,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:04:14,214 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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-28 14:04:16,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:04:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:17,300 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-04-28 14:04:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:04:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 35 [2022-04-28 14:04:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:04:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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-28 14:04:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 14:04:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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-28 14:04:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 14:04:17,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-28 14:04:19,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:19,350 INFO L225 Difference]: With dead ends: 103 [2022-04-28 14:04:19,350 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 14:04:19,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:04:19,351 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:04:19,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 14:04:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 14:04:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2022-04-28 14:04:19,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:04:19,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:04:19,471 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:04:19,471 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:04:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:19,474 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 14:04:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-28 14:04:19,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:19,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:19,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-28 14:04:19,475 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-28 14:04:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:04:19,477 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 14:04:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-28 14:04:19,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:04:19,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:04:19,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:04:19,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:04:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:04:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-04-28 14:04:19,480 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 35 [2022-04-28 14:04:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:04:19,480 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-04-28 14:04:19,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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-28 14:04:19,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 118 transitions. [2022-04-28 14:04:25,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 115 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:04:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-28 14:04:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:04:25,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:04:25,794 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:04:25,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 14:04:25,995 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,SelfDestructingSolverStorable11 [2022-04-28 14:04:25,995 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:04:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:04:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 1 times [2022-04-28 14:04:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:04:25,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742404957] [2022-04-28 14:04:32,054 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:04:32,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:04:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 2 times [2022-04-28 14:04:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:04:32,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144986453] [2022-04-28 14:04:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:04:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:04:32,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:04:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403539366] [2022-04-28 14:04:32,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:04:32,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:04:32,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:04:32,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:04:32,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 14:04:32,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:04:32,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:04:32,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:04:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:04:32,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:04:42,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #77#return; {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret7 := main(); {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:04:42,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #69#return; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#true} assume !!(#t~post6 < 50);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6409#true} {6409#true} #71#return; {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:04:42,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6409#true} is VALID [2022-04-28 14:04:42,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:04:42,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} assume !!(#t~post6 < 50);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:04:42,284 INFO L272 TraceCheckUtils]: 25: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:04:42,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} ~cond := #in~cond; {6492#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:42,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {6492#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:42,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:04:44,287 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} {6409#true} #71#return; {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-28 14:04:44,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:04:44,288 INFO L272 TraceCheckUtils]: 31: Hoare triple {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:04:44,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:04:44,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {6515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-28 14:04:44,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-28 14:04:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:04:44,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:05:20,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-28 14:05:20,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {6515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-28 14:05:20,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:20,576 INFO L272 TraceCheckUtils]: 31: Hoare triple {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:05:20,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {6534#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 14:05:20,578 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} {6409#true} #71#return; {6534#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 14:05:20,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:05:20,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {6547#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:05:20,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} ~cond := #in~cond; {6547#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:05:20,580 INFO L272 TraceCheckUtils]: 25: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} assume !!(#t~post6 < 50);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6409#true} {6409#true} #71#return; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L272 TraceCheckUtils]: 14: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#true} assume !!(#t~post6 < 50);havoc #t~post6; {6409#true} is VALID [2022-04-28 14:05:20,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #69#return; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret7 := main(); {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #77#return; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6409#true} is VALID [2022-04-28 14:05:20,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-28 14:05:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:05:20,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:20,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144986453] [2022-04-28 14:05:20,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:20,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403539366] [2022-04-28 14:05:20,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403539366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:05:20,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:05:20,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:05:20,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:20,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742404957] [2022-04-28 14:05:20,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742404957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:20,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:20,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:05:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275617719] [2022-04-28 14:05:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-28 14:05:20,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:20,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:05:22,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:22,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:05:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:22,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:05:22,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:05:22,607 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:05:25,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:05:28,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:05:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:28,624 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 14:05:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:05:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-28 14:05:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:05:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 14:05:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:05:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 14:05:28,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-28 14:05:30,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:30,666 INFO L225 Difference]: With dead ends: 101 [2022-04-28 14:05:30,667 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:05:30,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:05:30,668 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:30,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 121 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 14:05:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:05:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2022-04-28 14:05:30,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:30,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:30,761 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:30,761 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:30,763 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-28 14:05:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-28 14:05:30,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:30,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:30,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-28 14:05:30,764 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-28 14:05:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:30,766 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-28 14:05:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-28 14:05:30,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:30,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:30,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:30,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:05:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-28 14:05:30,769 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-04-28 14:05:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:30,769 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-04-28 14:05:30,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 14:05:30,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 86 transitions. [2022-04-28 14:05:35,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 84 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-04-28 14:05:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 14:05:35,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:35,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:05:35,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 14:05:35,255 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,SelfDestructingSolverStorable12 [2022-04-28 14:05:35,256 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 3 times [2022-04-28 14:05:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897924761] [2022-04-28 14:05:41,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:05:41,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:05:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 4 times [2022-04-28 14:05:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:41,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969773717] [2022-04-28 14:05:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:41,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:41,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568628635] [2022-04-28 14:05:41,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:05:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:41,324 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:05:41,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 14:05:41,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:05:41,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:41,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:05:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:41,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:41,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {7174#true} call ULTIMATE.init(); {7174#true} is VALID [2022-04-28 14:05:41,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {7174#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#(<= ~counter~0 0)} assume true; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#(<= ~counter~0 0)} {7174#true} #77#return; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#(<= ~counter~0 0)} call #t~ret7 := main(); {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {7182#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {7182#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#(<= ~counter~0 0)} ~cond := #in~cond; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#(<= ~counter~0 0)} assume !(0 == ~cond); {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#(<= ~counter~0 0)} assume true; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#(<= ~counter~0 0)} {7182#(<= ~counter~0 0)} #69#return; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {7182#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7182#(<= ~counter~0 0)} is VALID [2022-04-28 14:05:41,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {7216#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,546 INFO L272 TraceCheckUtils]: 14: Hoare triple {7216#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {7216#(<= ~counter~0 1)} ~cond := #in~cond; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {7216#(<= ~counter~0 1)} assume !(0 == ~cond); {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {7216#(<= ~counter~0 1)} assume true; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,548 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7216#(<= ~counter~0 1)} {7216#(<= ~counter~0 1)} #71#return; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {7216#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {7216#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7216#(<= ~counter~0 1)} is VALID [2022-04-28 14:05:41,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {7216#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {7244#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,550 INFO L272 TraceCheckUtils]: 23: Hoare triple {7244#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {7244#(<= ~counter~0 2)} ~cond := #in~cond; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {7244#(<= ~counter~0 2)} assume !(0 == ~cond); {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {7244#(<= ~counter~0 2)} assume true; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,551 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7244#(<= ~counter~0 2)} {7244#(<= ~counter~0 2)} #71#return; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {7244#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {7244#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7244#(<= ~counter~0 2)} is VALID [2022-04-28 14:05:41,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {7244#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7272#(<= |main_#t~post6| 2)} is VALID [2022-04-28 14:05:41,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {7272#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {7175#false} is VALID [2022-04-28 14:05:41,552 INFO L272 TraceCheckUtils]: 32: Hoare triple {7175#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7175#false} is VALID [2022-04-28 14:05:41,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {7175#false} ~cond := #in~cond; {7175#false} is VALID [2022-04-28 14:05:41,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {7175#false} assume 0 == ~cond; {7175#false} is VALID [2022-04-28 14:05:41,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {7175#false} assume !false; {7175#false} is VALID [2022-04-28 14:05:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:05:41,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:05:41,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {7175#false} assume !false; {7175#false} is VALID [2022-04-28 14:05:41,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {7175#false} assume 0 == ~cond; {7175#false} is VALID [2022-04-28 14:05:41,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {7175#false} ~cond := #in~cond; {7175#false} is VALID [2022-04-28 14:05:41,729 INFO L272 TraceCheckUtils]: 32: Hoare triple {7175#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7175#false} is VALID [2022-04-28 14:05:41,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {7300#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {7175#false} is VALID [2022-04-28 14:05:41,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {7304#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7300#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:05:41,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {7304#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7304#(< ~counter~0 50)} is VALID [2022-04-28 14:05:41,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {7304#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {7304#(< ~counter~0 50)} is VALID [2022-04-28 14:05:41,731 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7174#true} {7304#(< ~counter~0 50)} #71#return; {7304#(< ~counter~0 50)} is VALID [2022-04-28 14:05:41,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-28 14:05:41,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-28 14:05:41,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-28 14:05:41,732 INFO L272 TraceCheckUtils]: 23: Hoare triple {7304#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7174#true} is VALID [2022-04-28 14:05:41,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {7304#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {7304#(< ~counter~0 50)} is VALID [2022-04-28 14:05:41,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {7332#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7304#(< ~counter~0 50)} is VALID [2022-04-28 14:05:41,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {7332#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7332#(< ~counter~0 49)} is VALID [2022-04-28 14:05:41,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {7332#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {7332#(< ~counter~0 49)} is VALID [2022-04-28 14:05:41,734 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7174#true} {7332#(< ~counter~0 49)} #71#return; {7332#(< ~counter~0 49)} is VALID [2022-04-28 14:05:41,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-28 14:05:41,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-28 14:05:41,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-28 14:05:41,734 INFO L272 TraceCheckUtils]: 14: Hoare triple {7332#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7174#true} is VALID [2022-04-28 14:05:41,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {7332#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {7332#(< ~counter~0 49)} is VALID [2022-04-28 14:05:41,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {7360#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7332#(< ~counter~0 49)} is VALID [2022-04-28 14:05:41,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {7360#(< ~counter~0 48)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7174#true} {7360#(< ~counter~0 48)} #69#return; {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-28 14:05:41,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-28 14:05:41,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-28 14:05:41,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {7360#(< ~counter~0 48)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7174#true} is VALID [2022-04-28 14:05:41,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {7360#(< ~counter~0 48)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {7360#(< ~counter~0 48)} call #t~ret7 := main(); {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7360#(< ~counter~0 48)} {7174#true} #77#return; {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {7360#(< ~counter~0 48)} assume true; {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {7174#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7360#(< ~counter~0 48)} is VALID [2022-04-28 14:05:41,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {7174#true} call ULTIMATE.init(); {7174#true} is VALID [2022-04-28 14:05:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:05:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:41,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969773717] [2022-04-28 14:05:41,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:41,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568628635] [2022-04-28 14:05:41,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568628635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:05:41,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:05:41,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 14:05:41,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897924761] [2022-04-28 14:05:41,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897924761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:41,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:41,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:05:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113838672] [2022-04-28 14:05:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:41,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-28 14:05:41,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:41,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:05:41,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:41,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:05:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:05:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:05:41,772 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:05:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:42,036 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-28 14:05:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:05:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-28 14:05:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:05:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-28 14:05:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:05:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-28 14:05:42,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-28 14:05:42,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:42,116 INFO L225 Difference]: With dead ends: 108 [2022-04-28 14:05:42,116 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:05:42,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:05:42,117 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:42,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 114 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:05:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:05:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-28 14:05:42,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:42,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:42,234 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:42,234 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:42,236 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-28 14:05:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-28 14:05:42,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:42,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:42,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 98 states. [2022-04-28 14:05:42,237 INFO L87 Difference]: Start difference. First operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 98 states. [2022-04-28 14:05:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:42,239 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-28 14:05:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-28 14:05:42,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:42,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:42,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:42,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:05:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-04-28 14:05:42,242 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 36 [2022-04-28 14:05:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:42,242 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-04-28 14:05:42,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:05:42,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 116 transitions. [2022-04-28 14:05:48,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 113 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-04-28 14:05:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 14:05:48,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:48,751 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:05:48,767 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-28 14:05:48,952 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,SelfDestructingSolverStorable13 [2022-04-28 14:05:48,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 1 times [2022-04-28 14:05:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:48,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [574363059] [2022-04-28 14:05:55,004 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:05:55,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:05:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 2 times [2022-04-28 14:05:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:55,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948564072] [2022-04-28 14:05:55,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:55,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:55,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554028853] [2022-04-28 14:05:55,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:05:55,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:55,020 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:05:55,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 14:05:55,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:05:55,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:55,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:05:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:55,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:55,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {8007#true} call ULTIMATE.init(); {8007#true} is VALID [2022-04-28 14:05:55,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {8007#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8007#true} is VALID [2022-04-28 14:05:55,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:05:55,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8007#true} {8007#true} #77#return; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {8007#true} call #t~ret7 := main(); {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {8007#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {8007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8007#true} {8007#true} #69#return; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {8007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {8007#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {8007#true} assume !!(#t~post6 < 50);havoc #t~post6; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L272 TraceCheckUtils]: 14: Hoare triple {8007#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:05:55,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:05:55,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:05:55,190 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8007#true} {8007#true} #71#return; {8007#true} is VALID [2022-04-28 14:05:55,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {8007#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {8069#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {8069#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {8069#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#(not (= main_~a~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,191 INFO L272 TraceCheckUtils]: 25: Hoare triple {8069#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:05:55,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:05:55,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:05:55,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:05:55,192 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8007#true} {8069#(not (= main_~a~0 0))} #71#return; {8069#(not (= main_~a~0 0))} is VALID [2022-04-28 14:05:55,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {8069#(not (= main_~a~0 0))} assume !(0 != ~a~0 && 0 != ~b~0); {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:05:55,193 INFO L272 TraceCheckUtils]: 31: Hoare triple {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-28 14:05:55,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-28 14:05:55,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-28 14:05:55,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-28 14:05:55,193 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8007#true} {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} #73#return; {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-28 14:05:55,194 INFO L272 TraceCheckUtils]: 36: Hoare triple {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:05:55,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {8122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:55,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {8126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8008#false} is VALID [2022-04-28 14:05:55,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {8008#false} assume !false; {8008#false} is VALID [2022-04-28 14:05:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:05:55,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:05:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:55,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948564072] [2022-04-28 14:05:55,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:55,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554028853] [2022-04-28 14:05:55,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554028853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:55,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:55,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:05:55,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:55,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [574363059] [2022-04-28 14:05:55,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [574363059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:55,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:55,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:05:55,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887833709] [2022-04-28 14:05:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-28 14:05:55,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:55,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:05:55,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:05:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:05:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:05:55,221 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:05:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:55,494 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2022-04-28 14:05:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:05:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-28 14:05:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:05:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 14:05:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:05:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 14:05:55,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-28 14:05:55,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:05:55,535 INFO L225 Difference]: With dead ends: 126 [2022-04-28 14:05:55,535 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 14:05:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:05:55,536 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:05:55,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:05:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 14:05:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-04-28 14:05:55,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:55,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:55,646 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:55,646 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:55,649 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-04-28 14:05:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-04-28 14:05:55,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:55,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:55,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 114 states. [2022-04-28 14:05:55,650 INFO L87 Difference]: Start difference. First operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 114 states. [2022-04-28 14:05:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:55,652 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-04-28 14:05:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-04-28 14:05:55,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:55,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:55,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:55,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:05:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-04-28 14:05:55,655 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 40 [2022-04-28 14:05:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:55,655 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-04-28 14:05:55,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:05:55,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 123 transitions. [2022-04-28 14:06:04,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 119 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-04-28 14:06:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 14:06:04,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:04,147 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:04,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 14:06:04,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:04,348 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 1 times [2022-04-28 14:06:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:04,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085410036] [2022-04-28 14:06:09,793 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:09,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 2 times [2022-04-28 14:06:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:09,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255019793] [2022-04-28 14:06:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:09,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:09,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153829717] [2022-04-28 14:06:09,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:06:09,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:09,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:09,810 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:09,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 14:06:09,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:06:09,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:09,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:06:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:09,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:10,107 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 14:06:10,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {8818#true} call ULTIMATE.init(); {8818#true} is VALID [2022-04-28 14:06:10,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8818#true} is VALID [2022-04-28 14:06:10,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8818#true} {8818#true} #77#return; {8818#true} is VALID [2022-04-28 14:06:10,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {8818#true} call #t~ret7 := main(); {8818#true} is VALID [2022-04-28 14:06:10,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {8818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8818#true} is VALID [2022-04-28 14:06:10,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {8818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#true} ~cond := #in~cond; {8844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:06:10,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {8844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:06:10,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {8848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:06:10,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8848#(not (= |assume_abort_if_not_#in~cond| 0))} {8818#true} #69#return; {8855#(<= 1 main_~y~0)} is VALID [2022-04-28 14:06:10,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {8855#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {8859#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {8859#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,150 INFO L272 TraceCheckUtils]: 14: Hoare triple {8859#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,151 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8818#true} {8859#(<= 1 main_~b~0)} #71#return; {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {8859#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {8859#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {8859#(<= 1 main_~b~0)} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8859#(<= 1 main_~b~0)} is VALID [2022-04-28 14:06:10,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {8859#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:06:10,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {8893#(<= 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:06:10,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {8893#(<= 0 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:06:10,154 INFO L272 TraceCheckUtils]: 25: Hoare triple {8893#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,155 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8818#true} {8893#(<= 0 main_~b~0)} #71#return; {8893#(<= 0 main_~b~0)} is VALID [2022-04-28 14:06:10,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {8893#(<= 0 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:06:10,159 INFO L272 TraceCheckUtils]: 31: Hoare triple {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,160 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8818#true} {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} #73#return; {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 14:06:10,162 INFO L272 TraceCheckUtils]: 36: Hoare triple {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:06:10,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:06:10,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {8941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8819#false} is VALID [2022-04-28 14:06:10,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {8819#false} assume !false; {8819#false} is VALID [2022-04-28 14:06:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:06:10,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:10,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {8819#false} assume !false; {8819#false} is VALID [2022-04-28 14:06:10,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {8941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8819#false} is VALID [2022-04-28 14:06:10,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:06:10,379 INFO L272 TraceCheckUtils]: 36: Hoare triple {8957#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:06:10,380 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8818#true} {8957#(= (* main_~b~0 main_~a~0) 0)} #73#return; {8957#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 14:06:10,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,380 INFO L272 TraceCheckUtils]: 31: Hoare triple {8957#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {8818#true} assume !(0 != ~a~0 && 0 != ~b~0); {8957#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 14:06:10,381 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8818#true} {8818#true} #71#return; {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L272 TraceCheckUtils]: 25: Hoare triple {8818#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {8818#true} assume !!(#t~post6 < 50);havoc #t~post6; {8818#true} is VALID [2022-04-28 14:06:10,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {8818#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {8818#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {8818#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {8818#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {8818#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8818#true} {8818#true} #71#return; {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L272 TraceCheckUtils]: 14: Hoare triple {8818#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {8818#true} assume !!(#t~post6 < 50);havoc #t~post6; {8818#true} is VALID [2022-04-28 14:06:10,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {8818#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {8818#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8818#true} {8818#true} #69#return; {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {8818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {8818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {8818#true} call #t~ret7 := main(); {8818#true} is VALID [2022-04-28 14:06:10,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8818#true} {8818#true} #77#return; {8818#true} is VALID [2022-04-28 14:06:10,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-28 14:06:10,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8818#true} is VALID [2022-04-28 14:06:10,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {8818#true} call ULTIMATE.init(); {8818#true} is VALID [2022-04-28 14:06:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 14:06:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:10,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255019793] [2022-04-28 14:06:10,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153829717] [2022-04-28 14:06:10,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153829717] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:06:10,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:06:10,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 14:06:10,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085410036] [2022-04-28 14:06:10,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085410036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:10,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:10,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:06:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793926280] [2022-04-28 14:06:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 14:06:10,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:10,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:06:10,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:10,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:06:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:10,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:06:10,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:06:10,418 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:06:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:10,814 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-04-28 14:06:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:06:10,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 14:06:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:06:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:06:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:06:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:06:10,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:06:10,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:10,857 INFO L225 Difference]: With dead ends: 109 [2022-04-28 14:06:10,857 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 14:06:10,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:06:10,858 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:10,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 117 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:06:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 14:06:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2022-04-28 14:06:10,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:10,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:10,951 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:10,952 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:10,953 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-04-28 14:06:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-28 14:06:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:10,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:10,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-04-28 14:06:10,954 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-04-28 14:06:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:10,956 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-04-28 14:06:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-28 14:06:10,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:10,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:10,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:10,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-28 14:06:10,958 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 40 [2022-04-28 14:06:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:10,958 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-28 14:06:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:06:10,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-28 14:06:15,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 74 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 14:06:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 14:06:15,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:15,385 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:15,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 14:06:15,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:06:15,595 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 517832770, now seen corresponding path program 5 times [2022-04-28 14:06:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:15,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305914956] [2022-04-28 14:06:21,648 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:21,648 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 517832770, now seen corresponding path program 6 times [2022-04-28 14:06:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:21,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826224707] [2022-04-28 14:06:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:21,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:21,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716225014] [2022-04-28 14:06:21,664 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:06:21,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:21,672 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:21,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 14:06:21,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:06:21,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:21,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:06:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:21,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:21,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-28 14:06:21,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {9604#(<= ~counter~0 0)} assume true; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9604#(<= ~counter~0 0)} {9596#true} #77#return; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {9604#(<= ~counter~0 0)} call #t~ret7 := main(); {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {9604#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {9604#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {9604#(<= ~counter~0 0)} ~cond := #in~cond; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {9604#(<= ~counter~0 0)} assume !(0 == ~cond); {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {9604#(<= ~counter~0 0)} assume true; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9604#(<= ~counter~0 0)} {9604#(<= ~counter~0 0)} #69#return; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {9604#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9604#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:21,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {9604#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {9638#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,930 INFO L272 TraceCheckUtils]: 14: Hoare triple {9638#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {9638#(<= ~counter~0 1)} ~cond := #in~cond; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {9638#(<= ~counter~0 1)} assume !(0 == ~cond); {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {9638#(<= ~counter~0 1)} assume true; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,931 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9638#(<= ~counter~0 1)} {9638#(<= ~counter~0 1)} #71#return; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {9638#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {9638#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9638#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:21,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {9638#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {9666#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,933 INFO L272 TraceCheckUtils]: 23: Hoare triple {9666#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {9666#(<= ~counter~0 2)} ~cond := #in~cond; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {9666#(<= ~counter~0 2)} assume !(0 == ~cond); {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {9666#(<= ~counter~0 2)} assume true; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,935 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9666#(<= ~counter~0 2)} {9666#(<= ~counter~0 2)} #71#return; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {9666#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {9666#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9666#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:21,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {9666#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {9694#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,936 INFO L272 TraceCheckUtils]: 32: Hoare triple {9694#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {9694#(<= ~counter~0 3)} ~cond := #in~cond; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {9694#(<= ~counter~0 3)} assume !(0 == ~cond); {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {9694#(<= ~counter~0 3)} assume true; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,938 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9694#(<= ~counter~0 3)} {9694#(<= ~counter~0 3)} #71#return; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {9694#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {9694#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9694#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:21,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {9694#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9722#(<= |main_#t~post6| 3)} is VALID [2022-04-28 14:06:21,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {9722#(<= |main_#t~post6| 3)} assume !(#t~post6 < 50);havoc #t~post6; {9597#false} is VALID [2022-04-28 14:06:21,939 INFO L272 TraceCheckUtils]: 41: Hoare triple {9597#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9597#false} is VALID [2022-04-28 14:06:21,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {9597#false} ~cond := #in~cond; {9597#false} is VALID [2022-04-28 14:06:21,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {9597#false} assume 0 == ~cond; {9597#false} is VALID [2022-04-28 14:06:21,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-28 14:06:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:06:21,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:22,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-28 14:06:22,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {9597#false} assume 0 == ~cond; {9597#false} is VALID [2022-04-28 14:06:22,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {9597#false} ~cond := #in~cond; {9597#false} is VALID [2022-04-28 14:06:22,166 INFO L272 TraceCheckUtils]: 41: Hoare triple {9597#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9597#false} is VALID [2022-04-28 14:06:22,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {9750#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {9597#false} is VALID [2022-04-28 14:06:22,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {9754#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9750#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:06:22,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {9754#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9754#(< ~counter~0 50)} is VALID [2022-04-28 14:06:22,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {9754#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {9754#(< ~counter~0 50)} is VALID [2022-04-28 14:06:22,187 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9596#true} {9754#(< ~counter~0 50)} #71#return; {9754#(< ~counter~0 50)} is VALID [2022-04-28 14:06:22,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:06:22,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:06:22,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:06:22,187 INFO L272 TraceCheckUtils]: 32: Hoare triple {9754#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:06:22,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {9754#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {9754#(< ~counter~0 50)} is VALID [2022-04-28 14:06:22,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {9782#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9754#(< ~counter~0 50)} is VALID [2022-04-28 14:06:22,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {9782#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9782#(< ~counter~0 49)} is VALID [2022-04-28 14:06:22,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {9782#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {9782#(< ~counter~0 49)} is VALID [2022-04-28 14:06:22,191 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9596#true} {9782#(< ~counter~0 49)} #71#return; {9782#(< ~counter~0 49)} is VALID [2022-04-28 14:06:22,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:06:22,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:06:22,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:06:22,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {9782#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:06:22,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {9782#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {9782#(< ~counter~0 49)} is VALID [2022-04-28 14:06:22,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {9810#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9782#(< ~counter~0 49)} is VALID [2022-04-28 14:06:22,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {9810#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9810#(< ~counter~0 48)} is VALID [2022-04-28 14:06:22,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {9810#(< ~counter~0 48)} is VALID [2022-04-28 14:06:22,195 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9596#true} {9810#(< ~counter~0 48)} #71#return; {9810#(< ~counter~0 48)} is VALID [2022-04-28 14:06:22,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:06:22,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:06:22,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:06:22,195 INFO L272 TraceCheckUtils]: 14: Hoare triple {9810#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:06:22,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {9810#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {9810#(< ~counter~0 48)} is VALID [2022-04-28 14:06:22,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {9838#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9810#(< ~counter~0 48)} is VALID [2022-04-28 14:06:22,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {9838#(< ~counter~0 47)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9596#true} {9838#(< ~counter~0 47)} #69#return; {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-28 14:06:22,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-28 14:06:22,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-28 14:06:22,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {9838#(< ~counter~0 47)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9596#true} is VALID [2022-04-28 14:06:22,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {9838#(< ~counter~0 47)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {9838#(< ~counter~0 47)} call #t~ret7 := main(); {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9838#(< ~counter~0 47)} {9596#true} #77#return; {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {9838#(< ~counter~0 47)} assume true; {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9838#(< ~counter~0 47)} is VALID [2022-04-28 14:06:22,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-28 14:06:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:06:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826224707] [2022-04-28 14:06:22,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716225014] [2022-04-28 14:06:22,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716225014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:22,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:22,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 14:06:22,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:22,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305914956] [2022-04-28 14:06:22,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305914956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:22,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:22,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:06:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177741416] [2022-04-28 14:06:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-28 14:06:22,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:22,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:06:22,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:22,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:06:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:06:22,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:06:22,245 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:06:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:22,471 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-28 14:06:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:06:22,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-28 14:06:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:06:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 14:06:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:06:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 14:06:22,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-28 14:06:22,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:22,550 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:06:22,550 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:06:22,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:06:22,551 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:22,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:06:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:06:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:06:22,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:22,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:06:22,654 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:06:22,654 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:06:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:22,656 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-04-28 14:06:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 14:06:22,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:22,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:22,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-28 14:06:22,657 INFO L87 Difference]: Start difference. First operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-28 14:06:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:22,658 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-04-28 14:06:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 14:06:22,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:22,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:22,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:22,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:06:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-28 14:06:22,660 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 45 [2022-04-28 14:06:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:22,660 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-28 14:06:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:06:22,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 90 transitions. [2022-04-28 14:06:29,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 87 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 14:06:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 14:06:29,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:29,232 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:29,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 14:06:29,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:06:29,432 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 7 times [2022-04-28 14:06:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:29,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318271608] [2022-04-28 14:06:33,503 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:33,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:33,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 8 times [2022-04-28 14:06:33,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:33,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573548268] [2022-04-28 14:06:33,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:33,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:33,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740321718] [2022-04-28 14:06:33,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:06:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:33,536 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:33,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 14:06:33,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:06:33,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:33,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:06:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:33,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:33,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-28 14:06:33,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {10363#(<= ~counter~0 0)} assume true; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10363#(<= ~counter~0 0)} {10355#true} #77#return; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {10363#(<= ~counter~0 0)} call #t~ret7 := main(); {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {10363#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {10363#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {10363#(<= ~counter~0 0)} ~cond := #in~cond; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {10363#(<= ~counter~0 0)} assume !(0 == ~cond); {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {10363#(<= ~counter~0 0)} assume true; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10363#(<= ~counter~0 0)} {10363#(<= ~counter~0 0)} #69#return; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {10363#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10363#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:33,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {10363#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {10397#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,888 INFO L272 TraceCheckUtils]: 14: Hoare triple {10397#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {10397#(<= ~counter~0 1)} ~cond := #in~cond; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {10397#(<= ~counter~0 1)} assume !(0 == ~cond); {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {10397#(<= ~counter~0 1)} assume true; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,889 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10397#(<= ~counter~0 1)} {10397#(<= ~counter~0 1)} #71#return; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {10397#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {10397#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10397#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:33,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {10397#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {10425#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,891 INFO L272 TraceCheckUtils]: 23: Hoare triple {10425#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= ~counter~0 2)} ~cond := #in~cond; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= ~counter~0 2)} assume !(0 == ~cond); {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {10425#(<= ~counter~0 2)} assume true; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,892 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10425#(<= ~counter~0 2)} {10425#(<= ~counter~0 2)} #71#return; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {10425#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {10425#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10425#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:33,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {10425#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {10453#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,894 INFO L272 TraceCheckUtils]: 32: Hoare triple {10453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {10453#(<= ~counter~0 3)} ~cond := #in~cond; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {10453#(<= ~counter~0 3)} assume !(0 == ~cond); {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {10453#(<= ~counter~0 3)} assume true; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,896 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10453#(<= ~counter~0 3)} {10453#(<= ~counter~0 3)} #71#return; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {10453#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {10453#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10453#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:33,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {10453#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {10481#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,898 INFO L272 TraceCheckUtils]: 41: Hoare triple {10481#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {10481#(<= ~counter~0 4)} ~cond := #in~cond; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {10481#(<= ~counter~0 4)} assume !(0 == ~cond); {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {10481#(<= ~counter~0 4)} assume true; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,899 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10481#(<= ~counter~0 4)} {10481#(<= ~counter~0 4)} #71#return; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {10481#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {10481#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10481#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:33,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {10481#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10509#(<= |main_#t~post6| 4)} is VALID [2022-04-28 14:06:33,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {10509#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {10356#false} is VALID [2022-04-28 14:06:33,900 INFO L272 TraceCheckUtils]: 50: Hoare triple {10356#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10356#false} is VALID [2022-04-28 14:06:33,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {10356#false} ~cond := #in~cond; {10356#false} is VALID [2022-04-28 14:06:33,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {10356#false} assume 0 == ~cond; {10356#false} is VALID [2022-04-28 14:06:33,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-28 14:06:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:06:33,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:34,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-28 14:06:34,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {10356#false} assume 0 == ~cond; {10356#false} is VALID [2022-04-28 14:06:34,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {10356#false} ~cond := #in~cond; {10356#false} is VALID [2022-04-28 14:06:34,178 INFO L272 TraceCheckUtils]: 50: Hoare triple {10356#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10356#false} is VALID [2022-04-28 14:06:34,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {10537#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {10356#false} is VALID [2022-04-28 14:06:34,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {10541#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10537#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:06:34,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {10541#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10541#(< ~counter~0 50)} is VALID [2022-04-28 14:06:34,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {10541#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {10541#(< ~counter~0 50)} is VALID [2022-04-28 14:06:34,180 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10355#true} {10541#(< ~counter~0 50)} #71#return; {10541#(< ~counter~0 50)} is VALID [2022-04-28 14:06:34,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:06:34,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:06:34,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:06:34,180 INFO L272 TraceCheckUtils]: 41: Hoare triple {10541#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:06:34,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {10541#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {10541#(< ~counter~0 50)} is VALID [2022-04-28 14:06:34,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {10569#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10541#(< ~counter~0 50)} is VALID [2022-04-28 14:06:34,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {10569#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10569#(< ~counter~0 49)} is VALID [2022-04-28 14:06:34,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {10569#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {10569#(< ~counter~0 49)} is VALID [2022-04-28 14:06:34,182 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10355#true} {10569#(< ~counter~0 49)} #71#return; {10569#(< ~counter~0 49)} is VALID [2022-04-28 14:06:34,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:06:34,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:06:34,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:06:34,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {10569#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:06:34,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {10569#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {10569#(< ~counter~0 49)} is VALID [2022-04-28 14:06:34,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {10597#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10569#(< ~counter~0 49)} is VALID [2022-04-28 14:06:34,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {10597#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10597#(< ~counter~0 48)} is VALID [2022-04-28 14:06:34,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {10597#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {10597#(< ~counter~0 48)} is VALID [2022-04-28 14:06:34,184 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10355#true} {10597#(< ~counter~0 48)} #71#return; {10597#(< ~counter~0 48)} is VALID [2022-04-28 14:06:34,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:06:34,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:06:34,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:06:34,185 INFO L272 TraceCheckUtils]: 23: Hoare triple {10597#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:06:34,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {10597#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {10597#(< ~counter~0 48)} is VALID [2022-04-28 14:06:34,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {10625#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10597#(< ~counter~0 48)} is VALID [2022-04-28 14:06:34,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {10625#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10625#(< ~counter~0 47)} is VALID [2022-04-28 14:06:34,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {10625#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {10625#(< ~counter~0 47)} is VALID [2022-04-28 14:06:34,186 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10355#true} {10625#(< ~counter~0 47)} #71#return; {10625#(< ~counter~0 47)} is VALID [2022-04-28 14:06:34,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:06:34,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:06:34,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:06:34,187 INFO L272 TraceCheckUtils]: 14: Hoare triple {10625#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:06:34,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {10625#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {10625#(< ~counter~0 47)} is VALID [2022-04-28 14:06:34,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {10653#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10625#(< ~counter~0 47)} is VALID [2022-04-28 14:06:34,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {10653#(< ~counter~0 46)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10355#true} {10653#(< ~counter~0 46)} #69#return; {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-28 14:06:34,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-28 14:06:34,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-28 14:06:34,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {10653#(< ~counter~0 46)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10355#true} is VALID [2022-04-28 14:06:34,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {10653#(< ~counter~0 46)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {10653#(< ~counter~0 46)} call #t~ret7 := main(); {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10653#(< ~counter~0 46)} {10355#true} #77#return; {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {10653#(< ~counter~0 46)} assume true; {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10653#(< ~counter~0 46)} is VALID [2022-04-28 14:06:34,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-28 14:06:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:06:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:34,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573548268] [2022-04-28 14:06:34,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:34,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740321718] [2022-04-28 14:06:34,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740321718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:34,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:34,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 14:06:34,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:34,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318271608] [2022-04-28 14:06:34,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318271608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:34,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:34,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:06:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580328688] [2022-04-28 14:06:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-04-28 14:06:34,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:34,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:06:34,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:34,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:06:34,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:34,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:06:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:06:34,233 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:06:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:34,538 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-28 14:06:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:06:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-04-28 14:06:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:06:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-04-28 14:06:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:06:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-04-28 14:06:34,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2022-04-28 14:06:34,643 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-28 14:06:34,644 INFO L225 Difference]: With dead ends: 95 [2022-04-28 14:06:34,644 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 14:06:34,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:06:34,645 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:34,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 134 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:06:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 14:06:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 14:06:34,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:34,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:06:34,767 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:06:34,767 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:06:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:34,768 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 14:06:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-28 14:06:34,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:34,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:34,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 87 states. [2022-04-28 14:06:34,779 INFO L87 Difference]: Start difference. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 87 states. [2022-04-28 14:06:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:34,781 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-28 14:06:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-28 14:06:34,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:34,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:34,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:34,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:06:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2022-04-28 14:06:34,783 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 54 [2022-04-28 14:06:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:34,783 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2022-04-28 14:06:34,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:06:34,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 104 transitions. [2022-04-28 14:06:43,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 100 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-28 14:06:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:06:43,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:43,475 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:06:43,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:06:43,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:06:43,675 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:43,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash -323774, now seen corresponding path program 9 times [2022-04-28 14:06:43,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:43,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37771633] [2022-04-28 14:06:49,726 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:06:49,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:06:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash -323774, now seen corresponding path program 10 times [2022-04-28 14:06:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787804474] [2022-04-28 14:06:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:49,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:49,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:49,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953063953] [2022-04-28 14:06:49,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:06:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:49,751 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:06:49,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 14:06:49,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:06:49,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:49,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:06:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:49,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:50,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {11238#true} call ULTIMATE.init(); {11238#true} is VALID [2022-04-28 14:06:50,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {11246#(<= ~counter~0 0)} assume true; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11246#(<= ~counter~0 0)} {11238#true} #77#return; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {11246#(<= ~counter~0 0)} call #t~ret7 := main(); {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {11246#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {11246#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {11246#(<= ~counter~0 0)} ~cond := #in~cond; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {11246#(<= ~counter~0 0)} assume !(0 == ~cond); {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {11246#(<= ~counter~0 0)} assume true; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11246#(<= ~counter~0 0)} {11246#(<= ~counter~0 0)} #69#return; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {11246#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11246#(<= ~counter~0 0)} is VALID [2022-04-28 14:06:50,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {11246#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {11280#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,143 INFO L272 TraceCheckUtils]: 14: Hoare triple {11280#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {11280#(<= ~counter~0 1)} ~cond := #in~cond; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {11280#(<= ~counter~0 1)} assume !(0 == ~cond); {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {11280#(<= ~counter~0 1)} assume true; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,144 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11280#(<= ~counter~0 1)} {11280#(<= ~counter~0 1)} #71#return; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {11280#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {11280#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11280#(<= ~counter~0 1)} is VALID [2022-04-28 14:06:50,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {11280#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {11308#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,146 INFO L272 TraceCheckUtils]: 23: Hoare triple {11308#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {11308#(<= ~counter~0 2)} ~cond := #in~cond; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {11308#(<= ~counter~0 2)} assume !(0 == ~cond); {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {11308#(<= ~counter~0 2)} assume true; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,148 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11308#(<= ~counter~0 2)} {11308#(<= ~counter~0 2)} #71#return; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {11308#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {11308#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11308#(<= ~counter~0 2)} is VALID [2022-04-28 14:06:50,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {11308#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {11336#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,149 INFO L272 TraceCheckUtils]: 32: Hoare triple {11336#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {11336#(<= ~counter~0 3)} ~cond := #in~cond; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {11336#(<= ~counter~0 3)} assume !(0 == ~cond); {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {11336#(<= ~counter~0 3)} assume true; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,151 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11336#(<= ~counter~0 3)} {11336#(<= ~counter~0 3)} #71#return; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {11336#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {11336#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11336#(<= ~counter~0 3)} is VALID [2022-04-28 14:06:50,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {11336#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {11364#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,153 INFO L272 TraceCheckUtils]: 41: Hoare triple {11364#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {11364#(<= ~counter~0 4)} ~cond := #in~cond; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {11364#(<= ~counter~0 4)} assume !(0 == ~cond); {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {11364#(<= ~counter~0 4)} assume true; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,154 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11364#(<= ~counter~0 4)} {11364#(<= ~counter~0 4)} #71#return; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {11364#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {11364#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11364#(<= ~counter~0 4)} is VALID [2022-04-28 14:06:50,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {11364#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {11392#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,156 INFO L272 TraceCheckUtils]: 50: Hoare triple {11392#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {11392#(<= ~counter~0 5)} ~cond := #in~cond; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {11392#(<= ~counter~0 5)} assume !(0 == ~cond); {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {11392#(<= ~counter~0 5)} assume true; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,157 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11392#(<= ~counter~0 5)} {11392#(<= ~counter~0 5)} #71#return; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {11392#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {11392#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11392#(<= ~counter~0 5)} is VALID [2022-04-28 14:06:50,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {11392#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11420#(<= |main_#t~post6| 5)} is VALID [2022-04-28 14:06:50,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {11420#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {11239#false} is VALID [2022-04-28 14:06:50,158 INFO L272 TraceCheckUtils]: 59: Hoare triple {11239#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11239#false} is VALID [2022-04-28 14:06:50,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {11239#false} ~cond := #in~cond; {11239#false} is VALID [2022-04-28 14:06:50,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {11239#false} assume 0 == ~cond; {11239#false} is VALID [2022-04-28 14:06:50,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {11239#false} assume !false; {11239#false} is VALID [2022-04-28 14:06:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:06:50,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:06:50,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {11239#false} assume !false; {11239#false} is VALID [2022-04-28 14:06:50,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {11239#false} assume 0 == ~cond; {11239#false} is VALID [2022-04-28 14:06:50,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {11239#false} ~cond := #in~cond; {11239#false} is VALID [2022-04-28 14:06:50,464 INFO L272 TraceCheckUtils]: 59: Hoare triple {11239#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11239#false} is VALID [2022-04-28 14:06:50,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {11448#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {11239#false} is VALID [2022-04-28 14:06:50,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {11452#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11448#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:06:50,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {11452#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11452#(< ~counter~0 50)} is VALID [2022-04-28 14:06:50,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {11452#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {11452#(< ~counter~0 50)} is VALID [2022-04-28 14:06:50,466 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11238#true} {11452#(< ~counter~0 50)} #71#return; {11452#(< ~counter~0 50)} is VALID [2022-04-28 14:06:50,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:06:50,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:06:50,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:06:50,466 INFO L272 TraceCheckUtils]: 50: Hoare triple {11452#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:06:50,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {11452#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {11452#(< ~counter~0 50)} is VALID [2022-04-28 14:06:50,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {11480#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11452#(< ~counter~0 50)} is VALID [2022-04-28 14:06:50,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {11480#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11480#(< ~counter~0 49)} is VALID [2022-04-28 14:06:50,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {11480#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {11480#(< ~counter~0 49)} is VALID [2022-04-28 14:06:50,468 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11238#true} {11480#(< ~counter~0 49)} #71#return; {11480#(< ~counter~0 49)} is VALID [2022-04-28 14:06:50,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:06:50,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:06:50,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:06:50,468 INFO L272 TraceCheckUtils]: 41: Hoare triple {11480#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:06:50,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {11480#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {11480#(< ~counter~0 49)} is VALID [2022-04-28 14:06:50,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {11508#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11480#(< ~counter~0 49)} is VALID [2022-04-28 14:06:50,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {11508#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11508#(< ~counter~0 48)} is VALID [2022-04-28 14:06:50,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {11508#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {11508#(< ~counter~0 48)} is VALID [2022-04-28 14:06:50,470 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11238#true} {11508#(< ~counter~0 48)} #71#return; {11508#(< ~counter~0 48)} is VALID [2022-04-28 14:06:50,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:06:50,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:06:50,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:06:50,470 INFO L272 TraceCheckUtils]: 32: Hoare triple {11508#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:06:50,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {11508#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {11508#(< ~counter~0 48)} is VALID [2022-04-28 14:06:50,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {11536#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11508#(< ~counter~0 48)} is VALID [2022-04-28 14:06:50,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11536#(< ~counter~0 47)} is VALID [2022-04-28 14:06:50,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {11536#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {11536#(< ~counter~0 47)} is VALID [2022-04-28 14:06:50,472 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11238#true} {11536#(< ~counter~0 47)} #71#return; {11536#(< ~counter~0 47)} is VALID [2022-04-28 14:06:50,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:06:50,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:06:50,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:06:50,472 INFO L272 TraceCheckUtils]: 23: Hoare triple {11536#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:06:50,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {11536#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {11536#(< ~counter~0 47)} is VALID [2022-04-28 14:06:50,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {11564#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11536#(< ~counter~0 47)} is VALID [2022-04-28 14:06:50,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {11564#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11564#(< ~counter~0 46)} is VALID [2022-04-28 14:06:50,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {11564#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {11564#(< ~counter~0 46)} is VALID [2022-04-28 14:06:50,474 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11238#true} {11564#(< ~counter~0 46)} #71#return; {11564#(< ~counter~0 46)} is VALID [2022-04-28 14:06:50,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:06:50,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:06:50,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:06:50,475 INFO L272 TraceCheckUtils]: 14: Hoare triple {11564#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:06:50,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {11564#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {11564#(< ~counter~0 46)} is VALID [2022-04-28 14:06:50,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {11592#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11564#(< ~counter~0 46)} is VALID [2022-04-28 14:06:50,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {11592#(< ~counter~0 45)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11238#true} {11592#(< ~counter~0 45)} #69#return; {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-28 14:06:50,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-28 14:06:50,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-28 14:06:50,476 INFO L272 TraceCheckUtils]: 6: Hoare triple {11592#(< ~counter~0 45)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11238#true} is VALID [2022-04-28 14:06:50,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {11592#(< ~counter~0 45)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {11592#(< ~counter~0 45)} call #t~ret7 := main(); {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11592#(< ~counter~0 45)} {11238#true} #77#return; {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {11592#(< ~counter~0 45)} assume true; {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11592#(< ~counter~0 45)} is VALID [2022-04-28 14:06:50,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {11238#true} call ULTIMATE.init(); {11238#true} is VALID [2022-04-28 14:06:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:06:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:06:50,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787804474] [2022-04-28 14:06:50,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:06:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953063953] [2022-04-28 14:06:50,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953063953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:06:50,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:06:50,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 14:06:50,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:06:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37771633] [2022-04-28 14:06:50,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37771633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:06:50,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:06:50,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:06:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326697669] [2022-04-28 14:06:50,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:06:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 63 [2022-04-28 14:06:50,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:06:50,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:50,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:50,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:06:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:06:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:06:50,523 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:50,866 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-28 14:06:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:06:50,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 63 [2022-04-28 14:06:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-04-28 14:06:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-04-28 14:06:50,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2022-04-28 14:06:50,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:06:50,980 INFO L225 Difference]: With dead ends: 106 [2022-04-28 14:06:50,980 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 14:06:50,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:06:50,980 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:50,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 138 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:06:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 14:06:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-28 14:06:51,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:51,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:51,148 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:51,148 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:51,150 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-28 14:06:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-28 14:06:51,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:51,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:51,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 98 states. [2022-04-28 14:06:51,151 INFO L87 Difference]: Start difference. First operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 98 states. [2022-04-28 14:06:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:51,152 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-28 14:06:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-28 14:06:51,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:51,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:51,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:51,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:06:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-04-28 14:06:51,156 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 63 [2022-04-28 14:06:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:51,156 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-04-28 14:06:51,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:06:51,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 118 transitions. [2022-04-28 14:07:01,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 113 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-28 14:07:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 14:07:01,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:02,000 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:07:02,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 14:07:02,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:02,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:02,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1454644230, now seen corresponding path program 11 times [2022-04-28 14:07:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:02,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916281855] [2022-04-28 14:07:08,254 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:07:08,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:07:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1454644230, now seen corresponding path program 12 times [2022-04-28 14:07:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:08,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876492437] [2022-04-28 14:07:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:08,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:08,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662983585] [2022-04-28 14:07:08,266 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:07:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:08,271 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:07:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 14:07:08,333 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:07:08,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:08,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:07:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:08,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:08,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-28 14:07:08,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#(<= ~counter~0 0)} {12245#true} #77#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#(<= ~counter~0 0)} call #t~ret7 := main(); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {12253#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #69#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:08,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {12253#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {12287#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,677 INFO L272 TraceCheckUtils]: 14: Hoare triple {12287#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {12287#(<= ~counter~0 1)} ~cond := #in~cond; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {12287#(<= ~counter~0 1)} assume !(0 == ~cond); {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {12287#(<= ~counter~0 1)} assume true; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,679 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12287#(<= ~counter~0 1)} {12287#(<= ~counter~0 1)} #71#return; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {12287#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {12287#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12287#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:08,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {12287#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {12315#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,680 INFO L272 TraceCheckUtils]: 23: Hoare triple {12315#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {12315#(<= ~counter~0 2)} ~cond := #in~cond; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {12315#(<= ~counter~0 2)} assume !(0 == ~cond); {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {12315#(<= ~counter~0 2)} assume true; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,682 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12315#(<= ~counter~0 2)} {12315#(<= ~counter~0 2)} #71#return; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {12315#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {12315#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12315#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:08,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {12315#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {12343#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,685 INFO L272 TraceCheckUtils]: 32: Hoare triple {12343#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {12343#(<= ~counter~0 3)} ~cond := #in~cond; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {12343#(<= ~counter~0 3)} assume !(0 == ~cond); {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {12343#(<= ~counter~0 3)} assume true; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,687 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12343#(<= ~counter~0 3)} {12343#(<= ~counter~0 3)} #71#return; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {12343#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {12343#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12343#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:08,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {12343#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {12371#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,689 INFO L272 TraceCheckUtils]: 41: Hoare triple {12371#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {12371#(<= ~counter~0 4)} ~cond := #in~cond; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {12371#(<= ~counter~0 4)} assume !(0 == ~cond); {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {12371#(<= ~counter~0 4)} assume true; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,690 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12371#(<= ~counter~0 4)} {12371#(<= ~counter~0 4)} #71#return; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {12371#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {12371#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12371#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:08,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {12371#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {12399#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,692 INFO L272 TraceCheckUtils]: 50: Hoare triple {12399#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {12399#(<= ~counter~0 5)} ~cond := #in~cond; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {12399#(<= ~counter~0 5)} assume !(0 == ~cond); {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {12399#(<= ~counter~0 5)} assume true; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,693 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12399#(<= ~counter~0 5)} {12399#(<= ~counter~0 5)} #71#return; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {12399#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {12399#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12399#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:08,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {12399#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {12427#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,695 INFO L272 TraceCheckUtils]: 59: Hoare triple {12427#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {12427#(<= ~counter~0 6)} ~cond := #in~cond; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {12427#(<= ~counter~0 6)} assume !(0 == ~cond); {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {12427#(<= ~counter~0 6)} assume true; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,697 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12427#(<= ~counter~0 6)} {12427#(<= ~counter~0 6)} #71#return; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,697 INFO L290 TraceCheckUtils]: 64: Hoare triple {12427#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,697 INFO L290 TraceCheckUtils]: 65: Hoare triple {12427#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12427#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:08,697 INFO L290 TraceCheckUtils]: 66: Hoare triple {12427#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12455#(<= |main_#t~post6| 6)} is VALID [2022-04-28 14:07:08,698 INFO L290 TraceCheckUtils]: 67: Hoare triple {12455#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {12246#false} is VALID [2022-04-28 14:07:08,698 INFO L272 TraceCheckUtils]: 68: Hoare triple {12246#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12246#false} is VALID [2022-04-28 14:07:08,698 INFO L290 TraceCheckUtils]: 69: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-28 14:07:08,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-28 14:07:08,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 14:07:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:07:08,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:09,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 14:07:09,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-28 14:07:09,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-28 14:07:09,063 INFO L272 TraceCheckUtils]: 68: Hoare triple {12246#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12246#false} is VALID [2022-04-28 14:07:09,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {12483#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {12246#false} is VALID [2022-04-28 14:07:09,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {12487#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12483#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:07:09,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {12487#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12487#(< ~counter~0 50)} is VALID [2022-04-28 14:07:09,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {12487#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {12487#(< ~counter~0 50)} is VALID [2022-04-28 14:07:09,065 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12245#true} {12487#(< ~counter~0 50)} #71#return; {12487#(< ~counter~0 50)} is VALID [2022-04-28 14:07:09,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,065 INFO L272 TraceCheckUtils]: 59: Hoare triple {12487#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {12487#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {12487#(< ~counter~0 50)} is VALID [2022-04-28 14:07:09,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {12515#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12487#(< ~counter~0 50)} is VALID [2022-04-28 14:07:09,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {12515#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12515#(< ~counter~0 49)} is VALID [2022-04-28 14:07:09,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {12515#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {12515#(< ~counter~0 49)} is VALID [2022-04-28 14:07:09,068 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12245#true} {12515#(< ~counter~0 49)} #71#return; {12515#(< ~counter~0 49)} is VALID [2022-04-28 14:07:09,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,068 INFO L272 TraceCheckUtils]: 50: Hoare triple {12515#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {12515#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {12515#(< ~counter~0 49)} is VALID [2022-04-28 14:07:09,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {12543#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12515#(< ~counter~0 49)} is VALID [2022-04-28 14:07:09,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {12543#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12543#(< ~counter~0 48)} is VALID [2022-04-28 14:07:09,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {12543#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {12543#(< ~counter~0 48)} is VALID [2022-04-28 14:07:09,070 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12245#true} {12543#(< ~counter~0 48)} #71#return; {12543#(< ~counter~0 48)} is VALID [2022-04-28 14:07:09,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,070 INFO L272 TraceCheckUtils]: 41: Hoare triple {12543#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {12543#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {12543#(< ~counter~0 48)} is VALID [2022-04-28 14:07:09,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {12571#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12543#(< ~counter~0 48)} is VALID [2022-04-28 14:07:09,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {12571#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12571#(< ~counter~0 47)} is VALID [2022-04-28 14:07:09,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {12571#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {12571#(< ~counter~0 47)} is VALID [2022-04-28 14:07:09,072 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12245#true} {12571#(< ~counter~0 47)} #71#return; {12571#(< ~counter~0 47)} is VALID [2022-04-28 14:07:09,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,072 INFO L272 TraceCheckUtils]: 32: Hoare triple {12571#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {12571#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {12571#(< ~counter~0 47)} is VALID [2022-04-28 14:07:09,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {12599#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12571#(< ~counter~0 47)} is VALID [2022-04-28 14:07:09,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {12599#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12599#(< ~counter~0 46)} is VALID [2022-04-28 14:07:09,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {12599#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {12599#(< ~counter~0 46)} is VALID [2022-04-28 14:07:09,074 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12245#true} {12599#(< ~counter~0 46)} #71#return; {12599#(< ~counter~0 46)} is VALID [2022-04-28 14:07:09,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,074 INFO L272 TraceCheckUtils]: 23: Hoare triple {12599#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {12599#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {12599#(< ~counter~0 46)} is VALID [2022-04-28 14:07:09,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {12627#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12599#(< ~counter~0 46)} is VALID [2022-04-28 14:07:09,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {12627#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12627#(< ~counter~0 45)} is VALID [2022-04-28 14:07:09,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {12627#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {12627#(< ~counter~0 45)} is VALID [2022-04-28 14:07:09,076 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12245#true} {12627#(< ~counter~0 45)} #71#return; {12627#(< ~counter~0 45)} is VALID [2022-04-28 14:07:09,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,077 INFO L272 TraceCheckUtils]: 14: Hoare triple {12627#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {12627#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {12627#(< ~counter~0 45)} is VALID [2022-04-28 14:07:09,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {12655#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12627#(< ~counter~0 45)} is VALID [2022-04-28 14:07:09,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {12655#(< ~counter~0 44)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12655#(< ~counter~0 44)} #69#return; {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 14:07:09,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 14:07:09,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 14:07:09,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {12655#(< ~counter~0 44)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12245#true} is VALID [2022-04-28 14:07:09,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {12655#(< ~counter~0 44)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {12655#(< ~counter~0 44)} call #t~ret7 := main(); {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12655#(< ~counter~0 44)} {12245#true} #77#return; {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {12655#(< ~counter~0 44)} assume true; {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12655#(< ~counter~0 44)} is VALID [2022-04-28 14:07:09,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-28 14:07:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 14:07:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876492437] [2022-04-28 14:07:09,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:09,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662983585] [2022-04-28 14:07:09,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662983585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:09,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:09,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 14:07:09,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:09,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916281855] [2022-04-28 14:07:09,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916281855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:09,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:09,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:07:09,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749314548] [2022-04-28 14:07:09,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:09,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 72 [2022-04-28 14:07:09,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:09,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:07:09,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:09,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:07:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:09,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:07:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:07:09,139 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:07:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:09,512 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2022-04-28 14:07:09,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:07:09,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 72 [2022-04-28 14:07:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:07:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-28 14:07:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:07:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-28 14:07:09,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2022-04-28 14:07:09,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:09,646 INFO L225 Difference]: With dead ends: 117 [2022-04-28 14:07:09,646 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 14:07:09,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:07:09,647 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:09,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:07:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 14:07:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-28 14:07:09,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:09,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:07:09,839 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:07:09,839 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:07:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:09,841 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-28 14:07:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-28 14:07:09,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:09,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:09,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 109 states. [2022-04-28 14:07:09,842 INFO L87 Difference]: Start difference. First operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 109 states. [2022-04-28 14:07:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:09,844 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-28 14:07:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-28 14:07:09,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:09,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:09,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:09,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:07:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2022-04-28 14:07:09,847 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 72 [2022-04-28 14:07:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:09,847 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2022-04-28 14:07:09,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:07:09,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 132 transitions. [2022-04-28 14:07:22,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 126 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-28 14:07:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 14:07:22,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:22,785 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:07:22,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 14:07:22,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:22,991 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash -529342910, now seen corresponding path program 13 times [2022-04-28 14:07:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011427174] [2022-04-28 14:07:27,791 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:07:27,791 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:07:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash -529342910, now seen corresponding path program 14 times [2022-04-28 14:07:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:27,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400952744] [2022-04-28 14:07:27,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:27,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:27,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114682236] [2022-04-28 14:07:27,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:07:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:27,811 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:07:27,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 14:07:27,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:07:27,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:27,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:07:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:27,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:28,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {13376#true} call ULTIMATE.init(); {13376#true} is VALID [2022-04-28 14:07:28,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {13376#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {13384#(<= ~counter~0 0)} assume true; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13384#(<= ~counter~0 0)} {13376#true} #77#return; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {13384#(<= ~counter~0 0)} call #t~ret7 := main(); {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {13384#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {13384#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {13384#(<= ~counter~0 0)} ~cond := #in~cond; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {13384#(<= ~counter~0 0)} assume !(0 == ~cond); {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {13384#(<= ~counter~0 0)} assume true; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13384#(<= ~counter~0 0)} {13384#(<= ~counter~0 0)} #69#return; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {13384#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {13384#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:28,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {13384#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {13418#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,271 INFO L272 TraceCheckUtils]: 14: Hoare triple {13418#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {13418#(<= ~counter~0 1)} ~cond := #in~cond; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {13418#(<= ~counter~0 1)} assume !(0 == ~cond); {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {13418#(<= ~counter~0 1)} assume true; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,273 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13418#(<= ~counter~0 1)} {13418#(<= ~counter~0 1)} #71#return; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {13418#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {13418#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13418#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:28,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {13418#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {13446#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,274 INFO L272 TraceCheckUtils]: 23: Hoare triple {13446#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {13446#(<= ~counter~0 2)} ~cond := #in~cond; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {13446#(<= ~counter~0 2)} assume !(0 == ~cond); {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {13446#(<= ~counter~0 2)} assume true; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,276 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13446#(<= ~counter~0 2)} {13446#(<= ~counter~0 2)} #71#return; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {13446#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {13446#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13446#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:28,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {13446#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {13474#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,278 INFO L272 TraceCheckUtils]: 32: Hoare triple {13474#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {13474#(<= ~counter~0 3)} ~cond := #in~cond; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {13474#(<= ~counter~0 3)} assume !(0 == ~cond); {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {13474#(<= ~counter~0 3)} assume true; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,279 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13474#(<= ~counter~0 3)} {13474#(<= ~counter~0 3)} #71#return; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {13474#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {13474#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13474#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:28,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {13474#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {13502#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,294 INFO L272 TraceCheckUtils]: 41: Hoare triple {13502#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {13502#(<= ~counter~0 4)} ~cond := #in~cond; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {13502#(<= ~counter~0 4)} assume !(0 == ~cond); {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {13502#(<= ~counter~0 4)} assume true; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,296 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13502#(<= ~counter~0 4)} {13502#(<= ~counter~0 4)} #71#return; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {13502#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {13502#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13502#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:28,298 INFO L290 TraceCheckUtils]: 48: Hoare triple {13502#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {13530#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,300 INFO L272 TraceCheckUtils]: 50: Hoare triple {13530#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#(<= ~counter~0 5)} ~cond := #in~cond; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {13530#(<= ~counter~0 5)} assume !(0 == ~cond); {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {13530#(<= ~counter~0 5)} assume true; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,302 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13530#(<= ~counter~0 5)} {13530#(<= ~counter~0 5)} #71#return; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {13530#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13530#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:28,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {13558#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,306 INFO L272 TraceCheckUtils]: 59: Hoare triple {13558#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {13558#(<= ~counter~0 6)} ~cond := #in~cond; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {13558#(<= ~counter~0 6)} assume !(0 == ~cond); {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {13558#(<= ~counter~0 6)} assume true; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,308 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13558#(<= ~counter~0 6)} {13558#(<= ~counter~0 6)} #71#return; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {13558#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {13558#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13558#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:28,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {13558#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {13586#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,312 INFO L272 TraceCheckUtils]: 68: Hoare triple {13586#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {13586#(<= ~counter~0 7)} ~cond := #in~cond; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {13586#(<= ~counter~0 7)} assume !(0 == ~cond); {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,313 INFO L290 TraceCheckUtils]: 71: Hoare triple {13586#(<= ~counter~0 7)} assume true; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,315 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13586#(<= ~counter~0 7)} {13586#(<= ~counter~0 7)} #71#return; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {13586#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {13586#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13586#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:28,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {13586#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13614#(<= |main_#t~post6| 7)} is VALID [2022-04-28 14:07:28,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {13614#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {13377#false} is VALID [2022-04-28 14:07:28,317 INFO L272 TraceCheckUtils]: 77: Hoare triple {13377#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {13377#false} is VALID [2022-04-28 14:07:28,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {13377#false} ~cond := #in~cond; {13377#false} is VALID [2022-04-28 14:07:28,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {13377#false} assume 0 == ~cond; {13377#false} is VALID [2022-04-28 14:07:28,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {13377#false} assume !false; {13377#false} is VALID [2022-04-28 14:07:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:07:28,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:28,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {13377#false} assume !false; {13377#false} is VALID [2022-04-28 14:07:28,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {13377#false} assume 0 == ~cond; {13377#false} is VALID [2022-04-28 14:07:28,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {13377#false} ~cond := #in~cond; {13377#false} is VALID [2022-04-28 14:07:28,740 INFO L272 TraceCheckUtils]: 77: Hoare triple {13377#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {13377#false} is VALID [2022-04-28 14:07:28,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {13642#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {13377#false} is VALID [2022-04-28 14:07:28,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {13646#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13642#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:07:28,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {13646#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13646#(< ~counter~0 50)} is VALID [2022-04-28 14:07:28,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {13646#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {13646#(< ~counter~0 50)} is VALID [2022-04-28 14:07:28,742 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13376#true} {13646#(< ~counter~0 50)} #71#return; {13646#(< ~counter~0 50)} is VALID [2022-04-28 14:07:28,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,742 INFO L272 TraceCheckUtils]: 68: Hoare triple {13646#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {13646#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {13646#(< ~counter~0 50)} is VALID [2022-04-28 14:07:28,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {13674#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13646#(< ~counter~0 50)} is VALID [2022-04-28 14:07:28,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {13674#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13674#(< ~counter~0 49)} is VALID [2022-04-28 14:07:28,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {13674#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {13674#(< ~counter~0 49)} is VALID [2022-04-28 14:07:28,745 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13376#true} {13674#(< ~counter~0 49)} #71#return; {13674#(< ~counter~0 49)} is VALID [2022-04-28 14:07:28,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,745 INFO L272 TraceCheckUtils]: 59: Hoare triple {13674#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {13674#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {13674#(< ~counter~0 49)} is VALID [2022-04-28 14:07:28,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {13702#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13674#(< ~counter~0 49)} is VALID [2022-04-28 14:07:28,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {13702#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13702#(< ~counter~0 48)} is VALID [2022-04-28 14:07:28,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {13702#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {13702#(< ~counter~0 48)} is VALID [2022-04-28 14:07:28,747 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13376#true} {13702#(< ~counter~0 48)} #71#return; {13702#(< ~counter~0 48)} is VALID [2022-04-28 14:07:28,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,747 INFO L272 TraceCheckUtils]: 50: Hoare triple {13702#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {13702#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {13702#(< ~counter~0 48)} is VALID [2022-04-28 14:07:28,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {13730#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13702#(< ~counter~0 48)} is VALID [2022-04-28 14:07:28,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {13730#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13730#(< ~counter~0 47)} is VALID [2022-04-28 14:07:28,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {13730#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {13730#(< ~counter~0 47)} is VALID [2022-04-28 14:07:28,766 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13376#true} {13730#(< ~counter~0 47)} #71#return; {13730#(< ~counter~0 47)} is VALID [2022-04-28 14:07:28,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,766 INFO L272 TraceCheckUtils]: 41: Hoare triple {13730#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {13730#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {13730#(< ~counter~0 47)} is VALID [2022-04-28 14:07:28,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {13758#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13730#(< ~counter~0 47)} is VALID [2022-04-28 14:07:28,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {13758#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13758#(< ~counter~0 46)} is VALID [2022-04-28 14:07:28,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {13758#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {13758#(< ~counter~0 46)} is VALID [2022-04-28 14:07:28,768 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13376#true} {13758#(< ~counter~0 46)} #71#return; {13758#(< ~counter~0 46)} is VALID [2022-04-28 14:07:28,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,768 INFO L272 TraceCheckUtils]: 32: Hoare triple {13758#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {13758#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {13758#(< ~counter~0 46)} is VALID [2022-04-28 14:07:28,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {13786#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13758#(< ~counter~0 46)} is VALID [2022-04-28 14:07:28,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {13786#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13786#(< ~counter~0 45)} is VALID [2022-04-28 14:07:28,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {13786#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {13786#(< ~counter~0 45)} is VALID [2022-04-28 14:07:28,770 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13376#true} {13786#(< ~counter~0 45)} #71#return; {13786#(< ~counter~0 45)} is VALID [2022-04-28 14:07:28,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,771 INFO L272 TraceCheckUtils]: 23: Hoare triple {13786#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {13786#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {13786#(< ~counter~0 45)} is VALID [2022-04-28 14:07:28,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {13814#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13786#(< ~counter~0 45)} is VALID [2022-04-28 14:07:28,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {13814#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13814#(< ~counter~0 44)} is VALID [2022-04-28 14:07:28,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {13814#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {13814#(< ~counter~0 44)} is VALID [2022-04-28 14:07:28,773 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13376#true} {13814#(< ~counter~0 44)} #71#return; {13814#(< ~counter~0 44)} is VALID [2022-04-28 14:07:28,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,773 INFO L272 TraceCheckUtils]: 14: Hoare triple {13814#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {13814#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {13814#(< ~counter~0 44)} is VALID [2022-04-28 14:07:28,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {13842#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13814#(< ~counter~0 44)} is VALID [2022-04-28 14:07:28,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {13842#(< ~counter~0 43)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13376#true} {13842#(< ~counter~0 43)} #69#return; {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-28 14:07:28,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-28 14:07:28,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-28 14:07:28,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {13842#(< ~counter~0 43)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13376#true} is VALID [2022-04-28 14:07:28,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {13842#(< ~counter~0 43)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {13842#(< ~counter~0 43)} call #t~ret7 := main(); {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13842#(< ~counter~0 43)} {13376#true} #77#return; {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {13842#(< ~counter~0 43)} assume true; {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {13376#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13842#(< ~counter~0 43)} is VALID [2022-04-28 14:07:28,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {13376#true} call ULTIMATE.init(); {13376#true} is VALID [2022-04-28 14:07:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:07:28,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400952744] [2022-04-28 14:07:28,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114682236] [2022-04-28 14:07:28,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114682236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:28,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:28,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 14:07:28,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011427174] [2022-04-28 14:07:28,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011427174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:28,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:28,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:07:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352103548] [2022-04-28 14:07:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2022-04-28 14:07:28,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:28,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:07:28,848 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-28 14:07:28,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:07:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:28,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:07:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:07:28,849 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:07:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:29,362 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2022-04-28 14:07:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:07:29,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2022-04-28 14:07:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:07:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 141 transitions. [2022-04-28 14:07:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:07:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 141 transitions. [2022-04-28 14:07:29,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 141 transitions. [2022-04-28 14:07:29,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:29,488 INFO L225 Difference]: With dead ends: 128 [2022-04-28 14:07:29,488 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 14:07:29,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:07:29,489 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 67 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:29,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 186 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:07:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 14:07:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-28 14:07:29,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:29,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:07:29,678 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:07:29,678 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:07:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:29,680 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-28 14:07:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-28 14:07:29,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:29,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:29,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-28 14:07:29,681 INFO L87 Difference]: Start difference. First operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-28 14:07:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:29,684 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-28 14:07:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-28 14:07:29,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:29,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:29,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:29,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:07:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-28 14:07:29,687 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 81 [2022-04-28 14:07:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:29,688 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-28 14:07:29,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:07:29,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 146 transitions. [2022-04-28 14:07:45,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 139 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-28 14:07:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 14:07:45,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:45,063 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:07:45,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 14:07:45,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 14:07:45,271 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1054018310, now seen corresponding path program 15 times [2022-04-28 14:07:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:45,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762739686] [2022-04-28 14:07:51,325 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:07:51,325 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:07:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1054018310, now seen corresponding path program 16 times [2022-04-28 14:07:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:51,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536681211] [2022-04-28 14:07:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:51,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:51,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001123169] [2022-04-28 14:07:51,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:07:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:51,341 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:07:51,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 14:07:51,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:07:51,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:07:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:51,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:51,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {14631#true} call ULTIMATE.init(); {14631#true} is VALID [2022-04-28 14:07:51,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {14631#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {14639#(<= ~counter~0 0)} assume true; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14639#(<= ~counter~0 0)} {14631#true} #77#return; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {14639#(<= ~counter~0 0)} call #t~ret7 := main(); {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {14639#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {14639#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {14639#(<= ~counter~0 0)} ~cond := #in~cond; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {14639#(<= ~counter~0 0)} assume !(0 == ~cond); {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {14639#(<= ~counter~0 0)} assume true; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14639#(<= ~counter~0 0)} {14639#(<= ~counter~0 0)} #69#return; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {14639#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {14639#(<= ~counter~0 0)} is VALID [2022-04-28 14:07:51,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {14639#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {14673#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,872 INFO L272 TraceCheckUtils]: 14: Hoare triple {14673#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {14673#(<= ~counter~0 1)} ~cond := #in~cond; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {14673#(<= ~counter~0 1)} assume !(0 == ~cond); {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {14673#(<= ~counter~0 1)} assume true; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,873 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14673#(<= ~counter~0 1)} {14673#(<= ~counter~0 1)} #71#return; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {14673#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {14673#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14673#(<= ~counter~0 1)} is VALID [2022-04-28 14:07:51,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {14673#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {14701#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,875 INFO L272 TraceCheckUtils]: 23: Hoare triple {14701#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {14701#(<= ~counter~0 2)} ~cond := #in~cond; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {14701#(<= ~counter~0 2)} assume !(0 == ~cond); {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {14701#(<= ~counter~0 2)} assume true; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,877 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14701#(<= ~counter~0 2)} {14701#(<= ~counter~0 2)} #71#return; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {14701#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14701#(<= ~counter~0 2)} is VALID [2022-04-28 14:07:51,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {14701#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {14729#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,879 INFO L272 TraceCheckUtils]: 32: Hoare triple {14729#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {14729#(<= ~counter~0 3)} ~cond := #in~cond; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {14729#(<= ~counter~0 3)} assume !(0 == ~cond); {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {14729#(<= ~counter~0 3)} assume true; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,880 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14729#(<= ~counter~0 3)} {14729#(<= ~counter~0 3)} #71#return; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {14729#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {14729#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14729#(<= ~counter~0 3)} is VALID [2022-04-28 14:07:51,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {14729#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {14757#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,882 INFO L272 TraceCheckUtils]: 41: Hoare triple {14757#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {14757#(<= ~counter~0 4)} ~cond := #in~cond; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {14757#(<= ~counter~0 4)} assume !(0 == ~cond); {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {14757#(<= ~counter~0 4)} assume true; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,883 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14757#(<= ~counter~0 4)} {14757#(<= ~counter~0 4)} #71#return; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {14757#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {14757#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14757#(<= ~counter~0 4)} is VALID [2022-04-28 14:07:51,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {14757#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {14785#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,885 INFO L272 TraceCheckUtils]: 50: Hoare triple {14785#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {14785#(<= ~counter~0 5)} ~cond := #in~cond; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {14785#(<= ~counter~0 5)} assume !(0 == ~cond); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {14785#(<= ~counter~0 5)} assume true; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,887 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14785#(<= ~counter~0 5)} {14785#(<= ~counter~0 5)} #71#return; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,887 INFO L290 TraceCheckUtils]: 55: Hoare triple {14785#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {14785#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 14:07:51,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {14785#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,888 INFO L290 TraceCheckUtils]: 58: Hoare triple {14813#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,888 INFO L272 TraceCheckUtils]: 59: Hoare triple {14813#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,889 INFO L290 TraceCheckUtils]: 60: Hoare triple {14813#(<= ~counter~0 6)} ~cond := #in~cond; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {14813#(<= ~counter~0 6)} assume !(0 == ~cond); {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {14813#(<= ~counter~0 6)} assume true; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,890 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14813#(<= ~counter~0 6)} {14813#(<= ~counter~0 6)} #71#return; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {14813#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {14813#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14813#(<= ~counter~0 6)} is VALID [2022-04-28 14:07:51,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {14813#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {14841#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,892 INFO L272 TraceCheckUtils]: 68: Hoare triple {14841#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,892 INFO L290 TraceCheckUtils]: 69: Hoare triple {14841#(<= ~counter~0 7)} ~cond := #in~cond; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {14841#(<= ~counter~0 7)} assume !(0 == ~cond); {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {14841#(<= ~counter~0 7)} assume true; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,893 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14841#(<= ~counter~0 7)} {14841#(<= ~counter~0 7)} #71#return; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,893 INFO L290 TraceCheckUtils]: 73: Hoare triple {14841#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {14841#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14841#(<= ~counter~0 7)} is VALID [2022-04-28 14:07:51,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {14841#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {14869#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,895 INFO L272 TraceCheckUtils]: 77: Hoare triple {14869#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {14869#(<= ~counter~0 8)} ~cond := #in~cond; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,896 INFO L290 TraceCheckUtils]: 79: Hoare triple {14869#(<= ~counter~0 8)} assume !(0 == ~cond); {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,896 INFO L290 TraceCheckUtils]: 80: Hoare triple {14869#(<= ~counter~0 8)} assume true; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,896 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14869#(<= ~counter~0 8)} {14869#(<= ~counter~0 8)} #71#return; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,897 INFO L290 TraceCheckUtils]: 82: Hoare triple {14869#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {14869#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14869#(<= ~counter~0 8)} is VALID [2022-04-28 14:07:51,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {14869#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14897#(<= |main_#t~post6| 8)} is VALID [2022-04-28 14:07:51,898 INFO L290 TraceCheckUtils]: 85: Hoare triple {14897#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {14632#false} is VALID [2022-04-28 14:07:51,898 INFO L272 TraceCheckUtils]: 86: Hoare triple {14632#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {14632#false} is VALID [2022-04-28 14:07:51,898 INFO L290 TraceCheckUtils]: 87: Hoare triple {14632#false} ~cond := #in~cond; {14632#false} is VALID [2022-04-28 14:07:51,898 INFO L290 TraceCheckUtils]: 88: Hoare triple {14632#false} assume 0 == ~cond; {14632#false} is VALID [2022-04-28 14:07:51,898 INFO L290 TraceCheckUtils]: 89: Hoare triple {14632#false} assume !false; {14632#false} is VALID [2022-04-28 14:07:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:07:51,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:52,419 INFO L290 TraceCheckUtils]: 89: Hoare triple {14632#false} assume !false; {14632#false} is VALID [2022-04-28 14:07:52,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {14632#false} assume 0 == ~cond; {14632#false} is VALID [2022-04-28 14:07:52,419 INFO L290 TraceCheckUtils]: 87: Hoare triple {14632#false} ~cond := #in~cond; {14632#false} is VALID [2022-04-28 14:07:52,420 INFO L272 TraceCheckUtils]: 86: Hoare triple {14632#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {14632#false} is VALID [2022-04-28 14:07:52,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {14925#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {14632#false} is VALID [2022-04-28 14:07:52,420 INFO L290 TraceCheckUtils]: 84: Hoare triple {14929#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14925#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:07:52,420 INFO L290 TraceCheckUtils]: 83: Hoare triple {14929#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14929#(< ~counter~0 50)} is VALID [2022-04-28 14:07:52,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {14929#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {14929#(< ~counter~0 50)} is VALID [2022-04-28 14:07:52,421 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14631#true} {14929#(< ~counter~0 50)} #71#return; {14929#(< ~counter~0 50)} is VALID [2022-04-28 14:07:52,421 INFO L290 TraceCheckUtils]: 80: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,421 INFO L290 TraceCheckUtils]: 79: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,422 INFO L290 TraceCheckUtils]: 78: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,422 INFO L272 TraceCheckUtils]: 77: Hoare triple {14929#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,422 INFO L290 TraceCheckUtils]: 76: Hoare triple {14929#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {14929#(< ~counter~0 50)} is VALID [2022-04-28 14:07:52,422 INFO L290 TraceCheckUtils]: 75: Hoare triple {14957#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14929#(< ~counter~0 50)} is VALID [2022-04-28 14:07:52,423 INFO L290 TraceCheckUtils]: 74: Hoare triple {14957#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14957#(< ~counter~0 49)} is VALID [2022-04-28 14:07:52,423 INFO L290 TraceCheckUtils]: 73: Hoare triple {14957#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {14957#(< ~counter~0 49)} is VALID [2022-04-28 14:07:52,424 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14631#true} {14957#(< ~counter~0 49)} #71#return; {14957#(< ~counter~0 49)} is VALID [2022-04-28 14:07:52,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,424 INFO L272 TraceCheckUtils]: 68: Hoare triple {14957#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {14957#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {14957#(< ~counter~0 49)} is VALID [2022-04-28 14:07:52,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {14985#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14957#(< ~counter~0 49)} is VALID [2022-04-28 14:07:52,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {14985#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14985#(< ~counter~0 48)} is VALID [2022-04-28 14:07:52,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {14985#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {14985#(< ~counter~0 48)} is VALID [2022-04-28 14:07:52,426 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14631#true} {14985#(< ~counter~0 48)} #71#return; {14985#(< ~counter~0 48)} is VALID [2022-04-28 14:07:52,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,426 INFO L272 TraceCheckUtils]: 59: Hoare triple {14985#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {14985#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {14985#(< ~counter~0 48)} is VALID [2022-04-28 14:07:52,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {15013#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14985#(< ~counter~0 48)} is VALID [2022-04-28 14:07:52,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {15013#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15013#(< ~counter~0 47)} is VALID [2022-04-28 14:07:52,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {15013#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {15013#(< ~counter~0 47)} is VALID [2022-04-28 14:07:52,428 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14631#true} {15013#(< ~counter~0 47)} #71#return; {15013#(< ~counter~0 47)} is VALID [2022-04-28 14:07:52,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,428 INFO L272 TraceCheckUtils]: 50: Hoare triple {15013#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {15013#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {15013#(< ~counter~0 47)} is VALID [2022-04-28 14:07:52,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {15041#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15013#(< ~counter~0 47)} is VALID [2022-04-28 14:07:52,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {15041#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15041#(< ~counter~0 46)} is VALID [2022-04-28 14:07:52,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {15041#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {15041#(< ~counter~0 46)} is VALID [2022-04-28 14:07:52,430 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14631#true} {15041#(< ~counter~0 46)} #71#return; {15041#(< ~counter~0 46)} is VALID [2022-04-28 14:07:52,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,430 INFO L272 TraceCheckUtils]: 41: Hoare triple {15041#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {15041#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {15041#(< ~counter~0 46)} is VALID [2022-04-28 14:07:52,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {15069#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15041#(< ~counter~0 46)} is VALID [2022-04-28 14:07:52,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {15069#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15069#(< ~counter~0 45)} is VALID [2022-04-28 14:07:52,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {15069#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {15069#(< ~counter~0 45)} is VALID [2022-04-28 14:07:52,432 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14631#true} {15069#(< ~counter~0 45)} #71#return; {15069#(< ~counter~0 45)} is VALID [2022-04-28 14:07:52,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,432 INFO L272 TraceCheckUtils]: 32: Hoare triple {15069#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {15069#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {15069#(< ~counter~0 45)} is VALID [2022-04-28 14:07:52,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {15097#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15069#(< ~counter~0 45)} is VALID [2022-04-28 14:07:52,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {15097#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15097#(< ~counter~0 44)} is VALID [2022-04-28 14:07:52,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {15097#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {15097#(< ~counter~0 44)} is VALID [2022-04-28 14:07:52,434 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14631#true} {15097#(< ~counter~0 44)} #71#return; {15097#(< ~counter~0 44)} is VALID [2022-04-28 14:07:52,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,435 INFO L272 TraceCheckUtils]: 23: Hoare triple {15097#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {15097#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {15097#(< ~counter~0 44)} is VALID [2022-04-28 14:07:52,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {15125#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15097#(< ~counter~0 44)} is VALID [2022-04-28 14:07:52,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {15125#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15125#(< ~counter~0 43)} is VALID [2022-04-28 14:07:52,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {15125#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {15125#(< ~counter~0 43)} is VALID [2022-04-28 14:07:52,436 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14631#true} {15125#(< ~counter~0 43)} #71#return; {15125#(< ~counter~0 43)} is VALID [2022-04-28 14:07:52,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,437 INFO L272 TraceCheckUtils]: 14: Hoare triple {15125#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {15125#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {15125#(< ~counter~0 43)} is VALID [2022-04-28 14:07:52,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {15153#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15125#(< ~counter~0 43)} is VALID [2022-04-28 14:07:52,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {15153#(< ~counter~0 42)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14631#true} {15153#(< ~counter~0 42)} #69#return; {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-28 14:07:52,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-28 14:07:52,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-28 14:07:52,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {15153#(< ~counter~0 42)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14631#true} is VALID [2022-04-28 14:07:52,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {15153#(< ~counter~0 42)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {15153#(< ~counter~0 42)} call #t~ret7 := main(); {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15153#(< ~counter~0 42)} {14631#true} #77#return; {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {15153#(< ~counter~0 42)} assume true; {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {14631#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15153#(< ~counter~0 42)} is VALID [2022-04-28 14:07:52,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {14631#true} call ULTIMATE.init(); {14631#true} is VALID [2022-04-28 14:07:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 14:07:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536681211] [2022-04-28 14:07:52,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001123169] [2022-04-28 14:07:52,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001123169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:52,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:52,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 14:07:52,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762739686] [2022-04-28 14:07:52,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762739686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:52,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:52,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:07:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078313352] [2022-04-28 14:07:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:52,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 90 [2022-04-28 14:07:52,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:52,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:52,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:52,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:07:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:07:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:07:52,510 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:53,092 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2022-04-28 14:07:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:07:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 90 [2022-04-28 14:07:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 155 transitions. [2022-04-28 14:07:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 155 transitions. [2022-04-28 14:07:53,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 155 transitions. [2022-04-28 14:07:53,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:07:53,254 INFO L225 Difference]: With dead ends: 139 [2022-04-28 14:07:53,254 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 14:07:53,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 14:07:53,255 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:53,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:07:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 14:07:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 14:07:53,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:53,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:53,512 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:53,512 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:53,515 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2022-04-28 14:07:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-28 14:07:53,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:53,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:53,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 131 states. [2022-04-28 14:07:53,516 INFO L87 Difference]: Start difference. First operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 131 states. [2022-04-28 14:07:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:53,519 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2022-04-28 14:07:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-28 14:07:53,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:53,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:53,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:53,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:07:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-04-28 14:07:53,524 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 90 [2022-04-28 14:07:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:53,526 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-04-28 14:07:53,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:07:53,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 160 transitions. [2022-04-28 14:08:10,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 152 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-28 14:08:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 14:08:10,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:08:10,829 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:08:10,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 14:08:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 14:08:11,037 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:08:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:08:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash -164303550, now seen corresponding path program 17 times [2022-04-28 14:08:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792233250] [2022-04-28 14:08:17,088 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:08:17,088 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:08:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash -164303550, now seen corresponding path program 18 times [2022-04-28 14:08:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:08:17,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601852030] [2022-04-28 14:08:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:08:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:08:17,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:08:17,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335291907] [2022-04-28 14:08:17,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:08:17,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:08:17,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:08:17,104 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:08:17,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 14:08:17,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 14:08:17,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:08:17,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 14:08:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:08:17,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:08:17,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {16010#true} call ULTIMATE.init(); {16010#true} is VALID [2022-04-28 14:08:17,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {16010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {16018#(<= ~counter~0 0)} assume true; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16018#(<= ~counter~0 0)} {16010#true} #77#return; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {16018#(<= ~counter~0 0)} call #t~ret7 := main(); {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {16018#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {16018#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {16018#(<= ~counter~0 0)} ~cond := #in~cond; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {16018#(<= ~counter~0 0)} assume !(0 == ~cond); {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {16018#(<= ~counter~0 0)} assume true; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16018#(<= ~counter~0 0)} {16018#(<= ~counter~0 0)} #69#return; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {16018#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {16018#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:17,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {16018#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {16052#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,685 INFO L272 TraceCheckUtils]: 14: Hoare triple {16052#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {16052#(<= ~counter~0 1)} ~cond := #in~cond; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {16052#(<= ~counter~0 1)} assume !(0 == ~cond); {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {16052#(<= ~counter~0 1)} assume true; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,686 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16052#(<= ~counter~0 1)} {16052#(<= ~counter~0 1)} #71#return; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {16052#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {16052#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16052#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:17,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {16052#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {16080#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,688 INFO L272 TraceCheckUtils]: 23: Hoare triple {16080#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {16080#(<= ~counter~0 2)} ~cond := #in~cond; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {16080#(<= ~counter~0 2)} assume !(0 == ~cond); {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {16080#(<= ~counter~0 2)} assume true; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,689 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16080#(<= ~counter~0 2)} {16080#(<= ~counter~0 2)} #71#return; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {16080#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {16080#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16080#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:17,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {16080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {16108#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,691 INFO L272 TraceCheckUtils]: 32: Hoare triple {16108#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {16108#(<= ~counter~0 3)} ~cond := #in~cond; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {16108#(<= ~counter~0 3)} assume !(0 == ~cond); {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {16108#(<= ~counter~0 3)} assume true; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,692 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16108#(<= ~counter~0 3)} {16108#(<= ~counter~0 3)} #71#return; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {16108#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {16108#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16108#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:17,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {16108#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {16136#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,694 INFO L272 TraceCheckUtils]: 41: Hoare triple {16136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {16136#(<= ~counter~0 4)} ~cond := #in~cond; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {16136#(<= ~counter~0 4)} assume !(0 == ~cond); {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {16136#(<= ~counter~0 4)} assume true; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,695 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16136#(<= ~counter~0 4)} {16136#(<= ~counter~0 4)} #71#return; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {16136#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16136#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:17,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {16136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,697 INFO L272 TraceCheckUtils]: 50: Hoare triple {16164#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {16164#(<= ~counter~0 5)} ~cond := #in~cond; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {16164#(<= ~counter~0 5)} assume !(0 == ~cond); {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {16164#(<= ~counter~0 5)} assume true; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,699 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16164#(<= ~counter~0 5)} {16164#(<= ~counter~0 5)} #71#return; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {16164#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {16164#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16164#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:17,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {16164#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {16192#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,701 INFO L272 TraceCheckUtils]: 59: Hoare triple {16192#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {16192#(<= ~counter~0 6)} ~cond := #in~cond; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {16192#(<= ~counter~0 6)} assume !(0 == ~cond); {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {16192#(<= ~counter~0 6)} assume true; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,702 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16192#(<= ~counter~0 6)} {16192#(<= ~counter~0 6)} #71#return; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {16192#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {16192#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16192#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:17,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {16192#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,704 INFO L272 TraceCheckUtils]: 68: Hoare triple {16220#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {16220#(<= ~counter~0 7)} ~cond := #in~cond; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {16220#(<= ~counter~0 7)} assume !(0 == ~cond); {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {16220#(<= ~counter~0 7)} assume true; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,705 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16220#(<= ~counter~0 7)} {16220#(<= ~counter~0 7)} #71#return; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {16220#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {16220#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16220#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:17,706 INFO L290 TraceCheckUtils]: 75: Hoare triple {16220#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,706 INFO L290 TraceCheckUtils]: 76: Hoare triple {16248#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,707 INFO L272 TraceCheckUtils]: 77: Hoare triple {16248#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,707 INFO L290 TraceCheckUtils]: 78: Hoare triple {16248#(<= ~counter~0 8)} ~cond := #in~cond; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,707 INFO L290 TraceCheckUtils]: 79: Hoare triple {16248#(<= ~counter~0 8)} assume !(0 == ~cond); {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,708 INFO L290 TraceCheckUtils]: 80: Hoare triple {16248#(<= ~counter~0 8)} assume true; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,708 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16248#(<= ~counter~0 8)} {16248#(<= ~counter~0 8)} #71#return; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,709 INFO L290 TraceCheckUtils]: 82: Hoare triple {16248#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,709 INFO L290 TraceCheckUtils]: 83: Hoare triple {16248#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16248#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:17,709 INFO L290 TraceCheckUtils]: 84: Hoare triple {16248#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,710 INFO L290 TraceCheckUtils]: 85: Hoare triple {16276#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,710 INFO L272 TraceCheckUtils]: 86: Hoare triple {16276#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,710 INFO L290 TraceCheckUtils]: 87: Hoare triple {16276#(<= ~counter~0 9)} ~cond := #in~cond; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,711 INFO L290 TraceCheckUtils]: 88: Hoare triple {16276#(<= ~counter~0 9)} assume !(0 == ~cond); {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,711 INFO L290 TraceCheckUtils]: 89: Hoare triple {16276#(<= ~counter~0 9)} assume true; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,712 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16276#(<= ~counter~0 9)} {16276#(<= ~counter~0 9)} #71#return; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,712 INFO L290 TraceCheckUtils]: 91: Hoare triple {16276#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,712 INFO L290 TraceCheckUtils]: 92: Hoare triple {16276#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16276#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:17,712 INFO L290 TraceCheckUtils]: 93: Hoare triple {16276#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16304#(<= |main_#t~post6| 9)} is VALID [2022-04-28 14:08:17,713 INFO L290 TraceCheckUtils]: 94: Hoare triple {16304#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {16011#false} is VALID [2022-04-28 14:08:17,713 INFO L272 TraceCheckUtils]: 95: Hoare triple {16011#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {16011#false} is VALID [2022-04-28 14:08:17,713 INFO L290 TraceCheckUtils]: 96: Hoare triple {16011#false} ~cond := #in~cond; {16011#false} is VALID [2022-04-28 14:08:17,713 INFO L290 TraceCheckUtils]: 97: Hoare triple {16011#false} assume 0 == ~cond; {16011#false} is VALID [2022-04-28 14:08:17,713 INFO L290 TraceCheckUtils]: 98: Hoare triple {16011#false} assume !false; {16011#false} is VALID [2022-04-28 14:08:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:08:17,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:08:18,287 INFO L290 TraceCheckUtils]: 98: Hoare triple {16011#false} assume !false; {16011#false} is VALID [2022-04-28 14:08:18,287 INFO L290 TraceCheckUtils]: 97: Hoare triple {16011#false} assume 0 == ~cond; {16011#false} is VALID [2022-04-28 14:08:18,288 INFO L290 TraceCheckUtils]: 96: Hoare triple {16011#false} ~cond := #in~cond; {16011#false} is VALID [2022-04-28 14:08:18,288 INFO L272 TraceCheckUtils]: 95: Hoare triple {16011#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {16011#false} is VALID [2022-04-28 14:08:18,288 INFO L290 TraceCheckUtils]: 94: Hoare triple {16332#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {16011#false} is VALID [2022-04-28 14:08:18,288 INFO L290 TraceCheckUtils]: 93: Hoare triple {16336#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16332#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:08:18,289 INFO L290 TraceCheckUtils]: 92: Hoare triple {16336#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16336#(< ~counter~0 50)} is VALID [2022-04-28 14:08:18,289 INFO L290 TraceCheckUtils]: 91: Hoare triple {16336#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {16336#(< ~counter~0 50)} is VALID [2022-04-28 14:08:18,289 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16010#true} {16336#(< ~counter~0 50)} #71#return; {16336#(< ~counter~0 50)} is VALID [2022-04-28 14:08:18,290 INFO L290 TraceCheckUtils]: 89: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,290 INFO L290 TraceCheckUtils]: 88: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,290 INFO L290 TraceCheckUtils]: 87: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,290 INFO L272 TraceCheckUtils]: 86: Hoare triple {16336#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {16336#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {16336#(< ~counter~0 50)} is VALID [2022-04-28 14:08:18,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {16364#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16336#(< ~counter~0 50)} is VALID [2022-04-28 14:08:18,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {16364#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16364#(< ~counter~0 49)} is VALID [2022-04-28 14:08:18,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {16364#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {16364#(< ~counter~0 49)} is VALID [2022-04-28 14:08:18,292 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16010#true} {16364#(< ~counter~0 49)} #71#return; {16364#(< ~counter~0 49)} is VALID [2022-04-28 14:08:18,292 INFO L290 TraceCheckUtils]: 80: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,292 INFO L272 TraceCheckUtils]: 77: Hoare triple {16364#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {16364#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {16364#(< ~counter~0 49)} is VALID [2022-04-28 14:08:18,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {16392#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16364#(< ~counter~0 49)} is VALID [2022-04-28 14:08:18,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {16392#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16392#(< ~counter~0 48)} is VALID [2022-04-28 14:08:18,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {16392#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {16392#(< ~counter~0 48)} is VALID [2022-04-28 14:08:18,294 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16010#true} {16392#(< ~counter~0 48)} #71#return; {16392#(< ~counter~0 48)} is VALID [2022-04-28 14:08:18,294 INFO L290 TraceCheckUtils]: 71: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,294 INFO L290 TraceCheckUtils]: 69: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,294 INFO L272 TraceCheckUtils]: 68: Hoare triple {16392#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,294 INFO L290 TraceCheckUtils]: 67: Hoare triple {16392#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {16392#(< ~counter~0 48)} is VALID [2022-04-28 14:08:18,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {16420#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16392#(< ~counter~0 48)} is VALID [2022-04-28 14:08:18,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {16420#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16420#(< ~counter~0 47)} is VALID [2022-04-28 14:08:18,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {16420#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {16420#(< ~counter~0 47)} is VALID [2022-04-28 14:08:18,296 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16010#true} {16420#(< ~counter~0 47)} #71#return; {16420#(< ~counter~0 47)} is VALID [2022-04-28 14:08:18,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,296 INFO L272 TraceCheckUtils]: 59: Hoare triple {16420#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {16420#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {16420#(< ~counter~0 47)} is VALID [2022-04-28 14:08:18,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {16448#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16420#(< ~counter~0 47)} is VALID [2022-04-28 14:08:18,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {16448#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16448#(< ~counter~0 46)} is VALID [2022-04-28 14:08:18,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {16448#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {16448#(< ~counter~0 46)} is VALID [2022-04-28 14:08:18,298 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16010#true} {16448#(< ~counter~0 46)} #71#return; {16448#(< ~counter~0 46)} is VALID [2022-04-28 14:08:18,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,299 INFO L272 TraceCheckUtils]: 50: Hoare triple {16448#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {16448#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {16448#(< ~counter~0 46)} is VALID [2022-04-28 14:08:18,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {16476#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16448#(< ~counter~0 46)} is VALID [2022-04-28 14:08:18,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {16476#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16476#(< ~counter~0 45)} is VALID [2022-04-28 14:08:18,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {16476#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {16476#(< ~counter~0 45)} is VALID [2022-04-28 14:08:18,300 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16010#true} {16476#(< ~counter~0 45)} #71#return; {16476#(< ~counter~0 45)} is VALID [2022-04-28 14:08:18,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,301 INFO L272 TraceCheckUtils]: 41: Hoare triple {16476#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {16476#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {16476#(< ~counter~0 45)} is VALID [2022-04-28 14:08:18,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {16504#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16476#(< ~counter~0 45)} is VALID [2022-04-28 14:08:18,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {16504#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16504#(< ~counter~0 44)} is VALID [2022-04-28 14:08:18,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {16504#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {16504#(< ~counter~0 44)} is VALID [2022-04-28 14:08:18,303 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16010#true} {16504#(< ~counter~0 44)} #71#return; {16504#(< ~counter~0 44)} is VALID [2022-04-28 14:08:18,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,304 INFO L272 TraceCheckUtils]: 32: Hoare triple {16504#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {16504#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {16504#(< ~counter~0 44)} is VALID [2022-04-28 14:08:18,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {16532#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16504#(< ~counter~0 44)} is VALID [2022-04-28 14:08:18,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {16532#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16532#(< ~counter~0 43)} is VALID [2022-04-28 14:08:18,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {16532#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {16532#(< ~counter~0 43)} is VALID [2022-04-28 14:08:18,306 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16010#true} {16532#(< ~counter~0 43)} #71#return; {16532#(< ~counter~0 43)} is VALID [2022-04-28 14:08:18,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,306 INFO L272 TraceCheckUtils]: 23: Hoare triple {16532#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {16532#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {16532#(< ~counter~0 43)} is VALID [2022-04-28 14:08:18,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {16560#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16532#(< ~counter~0 43)} is VALID [2022-04-28 14:08:18,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {16560#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16560#(< ~counter~0 42)} is VALID [2022-04-28 14:08:18,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {16560#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {16560#(< ~counter~0 42)} is VALID [2022-04-28 14:08:18,309 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16010#true} {16560#(< ~counter~0 42)} #71#return; {16560#(< ~counter~0 42)} is VALID [2022-04-28 14:08:18,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,309 INFO L272 TraceCheckUtils]: 14: Hoare triple {16560#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {16560#(< ~counter~0 42)} is VALID [2022-04-28 14:08:18,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {16588#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16560#(< ~counter~0 42)} is VALID [2022-04-28 14:08:18,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {16588#(< ~counter~0 41)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16010#true} {16588#(< ~counter~0 41)} #69#return; {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-28 14:08:18,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-28 14:08:18,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-28 14:08:18,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {16588#(< ~counter~0 41)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16010#true} is VALID [2022-04-28 14:08:18,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {16588#(< ~counter~0 41)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {16588#(< ~counter~0 41)} call #t~ret7 := main(); {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16588#(< ~counter~0 41)} {16010#true} #77#return; {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {16588#(< ~counter~0 41)} assume true; {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {16010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16588#(< ~counter~0 41)} is VALID [2022-04-28 14:08:18,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {16010#true} call ULTIMATE.init(); {16010#true} is VALID [2022-04-28 14:08:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 14:08:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:08:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601852030] [2022-04-28 14:08:18,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:08:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335291907] [2022-04-28 14:08:18,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335291907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:08:18,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:08:18,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 14:08:18,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:08:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792233250] [2022-04-28 14:08:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792233250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:08:18,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:08:18,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:08:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721832375] [2022-04-28 14:08:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:08:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 99 [2022-04-28 14:08:18,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:08:18,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:08:18,385 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-28 14:08:18,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:08:18,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:18,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:08:18,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:08:18,386 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:08:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:18,956 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2022-04-28 14:08:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 14:08:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 99 [2022-04-28 14:08:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:08:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:08:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-04-28 14:08:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:08:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-04-28 14:08:18,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 169 transitions. [2022-04-28 14:08:19,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:19,131 INFO L225 Difference]: With dead ends: 150 [2022-04-28 14:08:19,131 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 14:08:19,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 14:08:19,132 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 122 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:08:19,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 186 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:08:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 14:08:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-28 14:08:19,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:08:19,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:19,417 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:19,417 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:19,420 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-04-28 14:08:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-28 14:08:19,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:19,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:19,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 142 states. [2022-04-28 14:08:19,421 INFO L87 Difference]: Start difference. First operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 142 states. [2022-04-28 14:08:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:19,424 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-04-28 14:08:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-28 14:08:19,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:19,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:19,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:08:19,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:08:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:08:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-04-28 14:08:19,428 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 99 [2022-04-28 14:08:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:08:19,428 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-04-28 14:08:19,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:08:19,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 174 transitions. [2022-04-28 14:08:38,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 165 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-28 14:08:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 14:08:38,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:08:38,996 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:08:39,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 14:08:39,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:08:39,197 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:08:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:08:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 19 times [2022-04-28 14:08:39,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:39,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960393006] [2022-04-28 14:08:45,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:08:45,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:08:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 20 times [2022-04-28 14:08:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:08:45,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8174481] [2022-04-28 14:08:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:08:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:08:45,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:08:45,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471628970] [2022-04-28 14:08:45,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:08:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:08:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:08:45,267 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:08:45,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 14:08:45,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:08:45,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:08:45,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 14:08:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:08:45,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:08:45,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {17513#true} call ULTIMATE.init(); {17513#true} is VALID [2022-04-28 14:08:45,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {17513#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {17521#(<= ~counter~0 0)} assume true; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17521#(<= ~counter~0 0)} {17513#true} #77#return; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {17521#(<= ~counter~0 0)} call #t~ret7 := main(); {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {17521#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {17521#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {17521#(<= ~counter~0 0)} ~cond := #in~cond; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {17521#(<= ~counter~0 0)} assume !(0 == ~cond); {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {17521#(<= ~counter~0 0)} assume true; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17521#(<= ~counter~0 0)} {17521#(<= ~counter~0 0)} #69#return; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {17521#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {17521#(<= ~counter~0 0)} is VALID [2022-04-28 14:08:45,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {17521#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {17555#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,871 INFO L272 TraceCheckUtils]: 14: Hoare triple {17555#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {17555#(<= ~counter~0 1)} ~cond := #in~cond; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {17555#(<= ~counter~0 1)} assume !(0 == ~cond); {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {17555#(<= ~counter~0 1)} assume true; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,872 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17555#(<= ~counter~0 1)} {17555#(<= ~counter~0 1)} #71#return; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {17555#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {17555#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17555#(<= ~counter~0 1)} is VALID [2022-04-28 14:08:45,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {17555#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {17583#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,874 INFO L272 TraceCheckUtils]: 23: Hoare triple {17583#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {17583#(<= ~counter~0 2)} ~cond := #in~cond; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {17583#(<= ~counter~0 2)} assume !(0 == ~cond); {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {17583#(<= ~counter~0 2)} assume true; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,875 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17583#(<= ~counter~0 2)} {17583#(<= ~counter~0 2)} #71#return; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {17583#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {17583#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17583#(<= ~counter~0 2)} is VALID [2022-04-28 14:08:45,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {17583#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {17611#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,877 INFO L272 TraceCheckUtils]: 32: Hoare triple {17611#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {17611#(<= ~counter~0 3)} ~cond := #in~cond; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {17611#(<= ~counter~0 3)} assume !(0 == ~cond); {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {17611#(<= ~counter~0 3)} assume true; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,879 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17611#(<= ~counter~0 3)} {17611#(<= ~counter~0 3)} #71#return; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {17611#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {17611#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17611#(<= ~counter~0 3)} is VALID [2022-04-28 14:08:45,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {17611#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {17639#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,880 INFO L272 TraceCheckUtils]: 41: Hoare triple {17639#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {17639#(<= ~counter~0 4)} ~cond := #in~cond; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {17639#(<= ~counter~0 4)} assume !(0 == ~cond); {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {17639#(<= ~counter~0 4)} assume true; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,882 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17639#(<= ~counter~0 4)} {17639#(<= ~counter~0 4)} #71#return; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {17639#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {17639#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17639#(<= ~counter~0 4)} is VALID [2022-04-28 14:08:45,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {17639#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {17667#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,884 INFO L272 TraceCheckUtils]: 50: Hoare triple {17667#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {17667#(<= ~counter~0 5)} ~cond := #in~cond; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {17667#(<= ~counter~0 5)} assume !(0 == ~cond); {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {17667#(<= ~counter~0 5)} assume true; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,885 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17667#(<= ~counter~0 5)} {17667#(<= ~counter~0 5)} #71#return; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {17667#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {17667#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17667#(<= ~counter~0 5)} is VALID [2022-04-28 14:08:45,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {17667#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {17695#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,887 INFO L272 TraceCheckUtils]: 59: Hoare triple {17695#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {17695#(<= ~counter~0 6)} ~cond := #in~cond; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {17695#(<= ~counter~0 6)} assume !(0 == ~cond); {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,888 INFO L290 TraceCheckUtils]: 62: Hoare triple {17695#(<= ~counter~0 6)} assume true; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,888 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17695#(<= ~counter~0 6)} {17695#(<= ~counter~0 6)} #71#return; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,888 INFO L290 TraceCheckUtils]: 64: Hoare triple {17695#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,889 INFO L290 TraceCheckUtils]: 65: Hoare triple {17695#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17695#(<= ~counter~0 6)} is VALID [2022-04-28 14:08:45,889 INFO L290 TraceCheckUtils]: 66: Hoare triple {17695#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,889 INFO L290 TraceCheckUtils]: 67: Hoare triple {17723#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,890 INFO L272 TraceCheckUtils]: 68: Hoare triple {17723#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,890 INFO L290 TraceCheckUtils]: 69: Hoare triple {17723#(<= ~counter~0 7)} ~cond := #in~cond; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {17723#(<= ~counter~0 7)} assume !(0 == ~cond); {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {17723#(<= ~counter~0 7)} assume true; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,891 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17723#(<= ~counter~0 7)} {17723#(<= ~counter~0 7)} #71#return; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {17723#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {17723#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17723#(<= ~counter~0 7)} is VALID [2022-04-28 14:08:45,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {17723#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,893 INFO L290 TraceCheckUtils]: 76: Hoare triple {17751#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,893 INFO L272 TraceCheckUtils]: 77: Hoare triple {17751#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {17751#(<= ~counter~0 8)} ~cond := #in~cond; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,894 INFO L290 TraceCheckUtils]: 79: Hoare triple {17751#(<= ~counter~0 8)} assume !(0 == ~cond); {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,894 INFO L290 TraceCheckUtils]: 80: Hoare triple {17751#(<= ~counter~0 8)} assume true; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,895 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17751#(<= ~counter~0 8)} {17751#(<= ~counter~0 8)} #71#return; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,895 INFO L290 TraceCheckUtils]: 82: Hoare triple {17751#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,895 INFO L290 TraceCheckUtils]: 83: Hoare triple {17751#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17751#(<= ~counter~0 8)} is VALID [2022-04-28 14:08:45,896 INFO L290 TraceCheckUtils]: 84: Hoare triple {17751#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,896 INFO L290 TraceCheckUtils]: 85: Hoare triple {17779#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,896 INFO L272 TraceCheckUtils]: 86: Hoare triple {17779#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,897 INFO L290 TraceCheckUtils]: 87: Hoare triple {17779#(<= ~counter~0 9)} ~cond := #in~cond; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,897 INFO L290 TraceCheckUtils]: 88: Hoare triple {17779#(<= ~counter~0 9)} assume !(0 == ~cond); {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,897 INFO L290 TraceCheckUtils]: 89: Hoare triple {17779#(<= ~counter~0 9)} assume true; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,898 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17779#(<= ~counter~0 9)} {17779#(<= ~counter~0 9)} #71#return; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,898 INFO L290 TraceCheckUtils]: 91: Hoare triple {17779#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {17779#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17779#(<= ~counter~0 9)} is VALID [2022-04-28 14:08:45,899 INFO L290 TraceCheckUtils]: 93: Hoare triple {17779#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,899 INFO L290 TraceCheckUtils]: 94: Hoare triple {17807#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,900 INFO L272 TraceCheckUtils]: 95: Hoare triple {17807#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {17807#(<= ~counter~0 10)} ~cond := #in~cond; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {17807#(<= ~counter~0 10)} assume !(0 == ~cond); {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {17807#(<= ~counter~0 10)} assume true; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,901 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {17807#(<= ~counter~0 10)} {17807#(<= ~counter~0 10)} #71#return; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,901 INFO L290 TraceCheckUtils]: 100: Hoare triple {17807#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,901 INFO L290 TraceCheckUtils]: 101: Hoare triple {17807#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17807#(<= ~counter~0 10)} is VALID [2022-04-28 14:08:45,902 INFO L290 TraceCheckUtils]: 102: Hoare triple {17807#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17835#(<= |main_#t~post6| 10)} is VALID [2022-04-28 14:08:45,902 INFO L290 TraceCheckUtils]: 103: Hoare triple {17835#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {17514#false} is VALID [2022-04-28 14:08:45,902 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {17514#false} is VALID [2022-04-28 14:08:45,902 INFO L290 TraceCheckUtils]: 105: Hoare triple {17514#false} ~cond := #in~cond; {17514#false} is VALID [2022-04-28 14:08:45,902 INFO L290 TraceCheckUtils]: 106: Hoare triple {17514#false} assume 0 == ~cond; {17514#false} is VALID [2022-04-28 14:08:45,902 INFO L290 TraceCheckUtils]: 107: Hoare triple {17514#false} assume !false; {17514#false} is VALID [2022-04-28 14:08:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:08:45,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:08:46,493 INFO L290 TraceCheckUtils]: 107: Hoare triple {17514#false} assume !false; {17514#false} is VALID [2022-04-28 14:08:46,493 INFO L290 TraceCheckUtils]: 106: Hoare triple {17514#false} assume 0 == ~cond; {17514#false} is VALID [2022-04-28 14:08:46,493 INFO L290 TraceCheckUtils]: 105: Hoare triple {17514#false} ~cond := #in~cond; {17514#false} is VALID [2022-04-28 14:08:46,493 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {17514#false} is VALID [2022-04-28 14:08:46,493 INFO L290 TraceCheckUtils]: 103: Hoare triple {17863#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {17514#false} is VALID [2022-04-28 14:08:46,494 INFO L290 TraceCheckUtils]: 102: Hoare triple {17867#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17863#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:08:46,494 INFO L290 TraceCheckUtils]: 101: Hoare triple {17867#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17867#(< ~counter~0 50)} is VALID [2022-04-28 14:08:46,494 INFO L290 TraceCheckUtils]: 100: Hoare triple {17867#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {17867#(< ~counter~0 50)} is VALID [2022-04-28 14:08:46,495 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {17513#true} {17867#(< ~counter~0 50)} #71#return; {17867#(< ~counter~0 50)} is VALID [2022-04-28 14:08:46,495 INFO L290 TraceCheckUtils]: 98: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,495 INFO L290 TraceCheckUtils]: 97: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,495 INFO L290 TraceCheckUtils]: 96: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,495 INFO L272 TraceCheckUtils]: 95: Hoare triple {17867#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {17867#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {17867#(< ~counter~0 50)} is VALID [2022-04-28 14:08:46,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {17895#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17867#(< ~counter~0 50)} is VALID [2022-04-28 14:08:46,496 INFO L290 TraceCheckUtils]: 92: Hoare triple {17895#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17895#(< ~counter~0 49)} is VALID [2022-04-28 14:08:46,497 INFO L290 TraceCheckUtils]: 91: Hoare triple {17895#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {17895#(< ~counter~0 49)} is VALID [2022-04-28 14:08:46,497 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17513#true} {17895#(< ~counter~0 49)} #71#return; {17895#(< ~counter~0 49)} is VALID [2022-04-28 14:08:46,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,498 INFO L272 TraceCheckUtils]: 86: Hoare triple {17895#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {17895#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {17895#(< ~counter~0 49)} is VALID [2022-04-28 14:08:46,498 INFO L290 TraceCheckUtils]: 84: Hoare triple {17923#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17895#(< ~counter~0 49)} is VALID [2022-04-28 14:08:46,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {17923#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17923#(< ~counter~0 48)} is VALID [2022-04-28 14:08:46,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {17923#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {17923#(< ~counter~0 48)} is VALID [2022-04-28 14:08:46,499 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17513#true} {17923#(< ~counter~0 48)} #71#return; {17923#(< ~counter~0 48)} is VALID [2022-04-28 14:08:46,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,500 INFO L290 TraceCheckUtils]: 79: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,500 INFO L272 TraceCheckUtils]: 77: Hoare triple {17923#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,500 INFO L290 TraceCheckUtils]: 76: Hoare triple {17923#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {17923#(< ~counter~0 48)} is VALID [2022-04-28 14:08:46,500 INFO L290 TraceCheckUtils]: 75: Hoare triple {17951#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17923#(< ~counter~0 48)} is VALID [2022-04-28 14:08:46,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {17951#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17951#(< ~counter~0 47)} is VALID [2022-04-28 14:08:46,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {17951#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {17951#(< ~counter~0 47)} is VALID [2022-04-28 14:08:46,501 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17513#true} {17951#(< ~counter~0 47)} #71#return; {17951#(< ~counter~0 47)} is VALID [2022-04-28 14:08:46,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,502 INFO L272 TraceCheckUtils]: 68: Hoare triple {17951#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {17951#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {17951#(< ~counter~0 47)} is VALID [2022-04-28 14:08:46,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {17979#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17951#(< ~counter~0 47)} is VALID [2022-04-28 14:08:46,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {17979#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17979#(< ~counter~0 46)} is VALID [2022-04-28 14:08:46,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {17979#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {17979#(< ~counter~0 46)} is VALID [2022-04-28 14:08:46,504 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17513#true} {17979#(< ~counter~0 46)} #71#return; {17979#(< ~counter~0 46)} is VALID [2022-04-28 14:08:46,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,504 INFO L272 TraceCheckUtils]: 59: Hoare triple {17979#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {17979#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {17979#(< ~counter~0 46)} is VALID [2022-04-28 14:08:46,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {18007#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17979#(< ~counter~0 46)} is VALID [2022-04-28 14:08:46,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {18007#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18007#(< ~counter~0 45)} is VALID [2022-04-28 14:08:46,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {18007#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {18007#(< ~counter~0 45)} is VALID [2022-04-28 14:08:46,506 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17513#true} {18007#(< ~counter~0 45)} #71#return; {18007#(< ~counter~0 45)} is VALID [2022-04-28 14:08:46,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,506 INFO L272 TraceCheckUtils]: 50: Hoare triple {18007#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {18007#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {18007#(< ~counter~0 45)} is VALID [2022-04-28 14:08:46,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {18035#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18007#(< ~counter~0 45)} is VALID [2022-04-28 14:08:46,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {18035#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18035#(< ~counter~0 44)} is VALID [2022-04-28 14:08:46,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {18035#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {18035#(< ~counter~0 44)} is VALID [2022-04-28 14:08:46,508 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17513#true} {18035#(< ~counter~0 44)} #71#return; {18035#(< ~counter~0 44)} is VALID [2022-04-28 14:08:46,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,508 INFO L272 TraceCheckUtils]: 41: Hoare triple {18035#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {18035#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {18035#(< ~counter~0 44)} is VALID [2022-04-28 14:08:46,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {18063#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18035#(< ~counter~0 44)} is VALID [2022-04-28 14:08:46,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {18063#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18063#(< ~counter~0 43)} is VALID [2022-04-28 14:08:46,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {18063#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {18063#(< ~counter~0 43)} is VALID [2022-04-28 14:08:46,510 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17513#true} {18063#(< ~counter~0 43)} #71#return; {18063#(< ~counter~0 43)} is VALID [2022-04-28 14:08:46,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,510 INFO L272 TraceCheckUtils]: 32: Hoare triple {18063#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {18063#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {18063#(< ~counter~0 43)} is VALID [2022-04-28 14:08:46,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {18091#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18063#(< ~counter~0 43)} is VALID [2022-04-28 14:08:46,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {18091#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18091#(< ~counter~0 42)} is VALID [2022-04-28 14:08:46,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {18091#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {18091#(< ~counter~0 42)} is VALID [2022-04-28 14:08:46,512 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17513#true} {18091#(< ~counter~0 42)} #71#return; {18091#(< ~counter~0 42)} is VALID [2022-04-28 14:08:46,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,512 INFO L272 TraceCheckUtils]: 23: Hoare triple {18091#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {18091#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {18091#(< ~counter~0 42)} is VALID [2022-04-28 14:08:46,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {18119#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18091#(< ~counter~0 42)} is VALID [2022-04-28 14:08:46,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {18119#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18119#(< ~counter~0 41)} is VALID [2022-04-28 14:08:46,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {18119#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {18119#(< ~counter~0 41)} is VALID [2022-04-28 14:08:46,514 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17513#true} {18119#(< ~counter~0 41)} #71#return; {18119#(< ~counter~0 41)} is VALID [2022-04-28 14:08:46,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,515 INFO L272 TraceCheckUtils]: 14: Hoare triple {18119#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {18119#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {18119#(< ~counter~0 41)} is VALID [2022-04-28 14:08:46,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {18147#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18119#(< ~counter~0 41)} is VALID [2022-04-28 14:08:46,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {18147#(< ~counter~0 40)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17513#true} {18147#(< ~counter~0 40)} #69#return; {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-28 14:08:46,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-28 14:08:46,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-28 14:08:46,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {18147#(< ~counter~0 40)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17513#true} is VALID [2022-04-28 14:08:46,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {18147#(< ~counter~0 40)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {18147#(< ~counter~0 40)} call #t~ret7 := main(); {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18147#(< ~counter~0 40)} {17513#true} #77#return; {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {18147#(< ~counter~0 40)} assume true; {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {17513#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18147#(< ~counter~0 40)} is VALID [2022-04-28 14:08:46,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {17513#true} call ULTIMATE.init(); {17513#true} is VALID [2022-04-28 14:08:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:08:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:08:46,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8174481] [2022-04-28 14:08:46,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:08:46,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471628970] [2022-04-28 14:08:46,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471628970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:08:46,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:08:46,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 14:08:46,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:08:46,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960393006] [2022-04-28 14:08:46,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960393006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:08:46,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:08:46,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:08:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421566638] [2022-04-28 14:08:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:08:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 108 [2022-04-28 14:08:46,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:08:46,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:08:46,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:46,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:08:46,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:46,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:08:46,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 14:08:46,605 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:08:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:47,254 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 14:08:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 14:08:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 108 [2022-04-28 14:08:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:08:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:08:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-04-28 14:08:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:08:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-04-28 14:08:47,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 183 transitions. [2022-04-28 14:08:47,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:08:47,440 INFO L225 Difference]: With dead ends: 161 [2022-04-28 14:08:47,440 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 14:08:47,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=531, Invalid=729, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 14:08:47,441 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:08:47,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 222 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:08:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 14:08:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-04-28 14:08:47,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:08:47,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:47,738 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:47,738 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:47,740 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2022-04-28 14:08:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 14:08:47,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:47,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:47,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-04-28 14:08:47,741 INFO L87 Difference]: Start difference. First operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-04-28 14:08:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:47,744 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2022-04-28 14:08:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 14:08:47,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:47,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:47,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:08:47,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:08:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:08:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-28 14:08:47,747 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 108 [2022-04-28 14:08:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:08:47,747 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-28 14:08:47,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:08:47,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-28 14:09:09,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 178 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 14:09:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 14:09:09,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:09,363 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:09,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 14:09:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:09,575 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash -617530302, now seen corresponding path program 21 times [2022-04-28 14:09:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828661554] [2022-04-28 14:09:15,627 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:09:15,627 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:09:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -617530302, now seen corresponding path program 22 times [2022-04-28 14:09:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:15,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439017538] [2022-04-28 14:09:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:15,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:15,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041732547] [2022-04-28 14:09:15,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:09:15,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:15,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:15,652 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:15,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 14:09:15,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:09:15,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:15,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:09:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:15,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:16,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {19140#true} call ULTIMATE.init(); {19140#true} is VALID [2022-04-28 14:09:16,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {19140#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {19148#(<= ~counter~0 0)} assume true; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19148#(<= ~counter~0 0)} {19140#true} #77#return; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {19148#(<= ~counter~0 0)} call #t~ret7 := main(); {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {19148#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {19148#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {19148#(<= ~counter~0 0)} ~cond := #in~cond; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {19148#(<= ~counter~0 0)} assume !(0 == ~cond); {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {19148#(<= ~counter~0 0)} assume true; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19148#(<= ~counter~0 0)} {19148#(<= ~counter~0 0)} #69#return; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {19148#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {19148#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:16,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {19148#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {19182#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,364 INFO L272 TraceCheckUtils]: 14: Hoare triple {19182#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {19182#(<= ~counter~0 1)} ~cond := #in~cond; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {19182#(<= ~counter~0 1)} assume !(0 == ~cond); {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {19182#(<= ~counter~0 1)} assume true; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,366 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19182#(<= ~counter~0 1)} {19182#(<= ~counter~0 1)} #71#return; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {19182#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {19182#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19182#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:16,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {19182#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {19210#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,368 INFO L272 TraceCheckUtils]: 23: Hoare triple {19210#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {19210#(<= ~counter~0 2)} ~cond := #in~cond; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {19210#(<= ~counter~0 2)} assume !(0 == ~cond); {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {19210#(<= ~counter~0 2)} assume true; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,369 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19210#(<= ~counter~0 2)} {19210#(<= ~counter~0 2)} #71#return; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {19210#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {19210#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19210#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:16,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {19210#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {19238#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,371 INFO L272 TraceCheckUtils]: 32: Hoare triple {19238#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {19238#(<= ~counter~0 3)} ~cond := #in~cond; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {19238#(<= ~counter~0 3)} assume !(0 == ~cond); {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {19238#(<= ~counter~0 3)} assume true; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,372 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19238#(<= ~counter~0 3)} {19238#(<= ~counter~0 3)} #71#return; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {19238#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {19238#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19238#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:16,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {19238#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {19266#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,374 INFO L272 TraceCheckUtils]: 41: Hoare triple {19266#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {19266#(<= ~counter~0 4)} ~cond := #in~cond; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {19266#(<= ~counter~0 4)} assume !(0 == ~cond); {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {19266#(<= ~counter~0 4)} assume true; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,375 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19266#(<= ~counter~0 4)} {19266#(<= ~counter~0 4)} #71#return; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {19266#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {19266#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19266#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:16,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {19266#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {19294#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,377 INFO L272 TraceCheckUtils]: 50: Hoare triple {19294#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {19294#(<= ~counter~0 5)} ~cond := #in~cond; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {19294#(<= ~counter~0 5)} assume !(0 == ~cond); {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {19294#(<= ~counter~0 5)} assume true; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,379 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19294#(<= ~counter~0 5)} {19294#(<= ~counter~0 5)} #71#return; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {19294#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {19294#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19294#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:16,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {19294#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {19322#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,381 INFO L272 TraceCheckUtils]: 59: Hoare triple {19322#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {19322#(<= ~counter~0 6)} ~cond := #in~cond; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {19322#(<= ~counter~0 6)} assume !(0 == ~cond); {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {19322#(<= ~counter~0 6)} assume true; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,382 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19322#(<= ~counter~0 6)} {19322#(<= ~counter~0 6)} #71#return; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {19322#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {19322#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19322#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:16,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {19322#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {19350#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,384 INFO L272 TraceCheckUtils]: 68: Hoare triple {19350#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {19350#(<= ~counter~0 7)} ~cond := #in~cond; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {19350#(<= ~counter~0 7)} assume !(0 == ~cond); {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {19350#(<= ~counter~0 7)} assume true; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,385 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19350#(<= ~counter~0 7)} {19350#(<= ~counter~0 7)} #71#return; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {19350#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {19350#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19350#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:16,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {19350#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {19378#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,388 INFO L272 TraceCheckUtils]: 77: Hoare triple {19378#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {19378#(<= ~counter~0 8)} ~cond := #in~cond; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {19378#(<= ~counter~0 8)} assume !(0 == ~cond); {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {19378#(<= ~counter~0 8)} assume true; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,390 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19378#(<= ~counter~0 8)} {19378#(<= ~counter~0 8)} #71#return; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,390 INFO L290 TraceCheckUtils]: 82: Hoare triple {19378#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {19378#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19378#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:16,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {19378#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {19406#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,391 INFO L272 TraceCheckUtils]: 86: Hoare triple {19406#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,392 INFO L290 TraceCheckUtils]: 87: Hoare triple {19406#(<= ~counter~0 9)} ~cond := #in~cond; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {19406#(<= ~counter~0 9)} assume !(0 == ~cond); {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {19406#(<= ~counter~0 9)} assume true; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,393 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19406#(<= ~counter~0 9)} {19406#(<= ~counter~0 9)} #71#return; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {19406#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {19406#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19406#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:16,394 INFO L290 TraceCheckUtils]: 93: Hoare triple {19406#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,394 INFO L290 TraceCheckUtils]: 94: Hoare triple {19434#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,395 INFO L272 TraceCheckUtils]: 95: Hoare triple {19434#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {19434#(<= ~counter~0 10)} ~cond := #in~cond; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,395 INFO L290 TraceCheckUtils]: 97: Hoare triple {19434#(<= ~counter~0 10)} assume !(0 == ~cond); {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,396 INFO L290 TraceCheckUtils]: 98: Hoare triple {19434#(<= ~counter~0 10)} assume true; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,396 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19434#(<= ~counter~0 10)} {19434#(<= ~counter~0 10)} #71#return; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,396 INFO L290 TraceCheckUtils]: 100: Hoare triple {19434#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,397 INFO L290 TraceCheckUtils]: 101: Hoare triple {19434#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19434#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:16,397 INFO L290 TraceCheckUtils]: 102: Hoare triple {19434#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,397 INFO L290 TraceCheckUtils]: 103: Hoare triple {19462#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,398 INFO L272 TraceCheckUtils]: 104: Hoare triple {19462#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,398 INFO L290 TraceCheckUtils]: 105: Hoare triple {19462#(<= ~counter~0 11)} ~cond := #in~cond; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,399 INFO L290 TraceCheckUtils]: 106: Hoare triple {19462#(<= ~counter~0 11)} assume !(0 == ~cond); {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,399 INFO L290 TraceCheckUtils]: 107: Hoare triple {19462#(<= ~counter~0 11)} assume true; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,399 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19462#(<= ~counter~0 11)} {19462#(<= ~counter~0 11)} #71#return; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,400 INFO L290 TraceCheckUtils]: 109: Hoare triple {19462#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,400 INFO L290 TraceCheckUtils]: 110: Hoare triple {19462#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19462#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:16,400 INFO L290 TraceCheckUtils]: 111: Hoare triple {19462#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19490#(<= |main_#t~post6| 11)} is VALID [2022-04-28 14:09:16,401 INFO L290 TraceCheckUtils]: 112: Hoare triple {19490#(<= |main_#t~post6| 11)} assume !(#t~post6 < 50);havoc #t~post6; {19141#false} is VALID [2022-04-28 14:09:16,401 INFO L272 TraceCheckUtils]: 113: Hoare triple {19141#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {19141#false} is VALID [2022-04-28 14:09:16,401 INFO L290 TraceCheckUtils]: 114: Hoare triple {19141#false} ~cond := #in~cond; {19141#false} is VALID [2022-04-28 14:09:16,401 INFO L290 TraceCheckUtils]: 115: Hoare triple {19141#false} assume 0 == ~cond; {19141#false} is VALID [2022-04-28 14:09:16,401 INFO L290 TraceCheckUtils]: 116: Hoare triple {19141#false} assume !false; {19141#false} is VALID [2022-04-28 14:09:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 22 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:09:16,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:17,062 INFO L290 TraceCheckUtils]: 116: Hoare triple {19141#false} assume !false; {19141#false} is VALID [2022-04-28 14:09:17,062 INFO L290 TraceCheckUtils]: 115: Hoare triple {19141#false} assume 0 == ~cond; {19141#false} is VALID [2022-04-28 14:09:17,062 INFO L290 TraceCheckUtils]: 114: Hoare triple {19141#false} ~cond := #in~cond; {19141#false} is VALID [2022-04-28 14:09:17,062 INFO L272 TraceCheckUtils]: 113: Hoare triple {19141#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {19141#false} is VALID [2022-04-28 14:09:17,062 INFO L290 TraceCheckUtils]: 112: Hoare triple {19518#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {19141#false} is VALID [2022-04-28 14:09:17,063 INFO L290 TraceCheckUtils]: 111: Hoare triple {19522#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19518#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:09:17,063 INFO L290 TraceCheckUtils]: 110: Hoare triple {19522#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19522#(< ~counter~0 50)} is VALID [2022-04-28 14:09:17,063 INFO L290 TraceCheckUtils]: 109: Hoare triple {19522#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {19522#(< ~counter~0 50)} is VALID [2022-04-28 14:09:17,064 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19140#true} {19522#(< ~counter~0 50)} #71#return; {19522#(< ~counter~0 50)} is VALID [2022-04-28 14:09:17,064 INFO L290 TraceCheckUtils]: 107: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,064 INFO L290 TraceCheckUtils]: 106: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,064 INFO L290 TraceCheckUtils]: 105: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,064 INFO L272 TraceCheckUtils]: 104: Hoare triple {19522#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {19522#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {19522#(< ~counter~0 50)} is VALID [2022-04-28 14:09:17,065 INFO L290 TraceCheckUtils]: 102: Hoare triple {19550#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19522#(< ~counter~0 50)} is VALID [2022-04-28 14:09:17,065 INFO L290 TraceCheckUtils]: 101: Hoare triple {19550#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19550#(< ~counter~0 49)} is VALID [2022-04-28 14:09:17,065 INFO L290 TraceCheckUtils]: 100: Hoare triple {19550#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {19550#(< ~counter~0 49)} is VALID [2022-04-28 14:09:17,066 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19140#true} {19550#(< ~counter~0 49)} #71#return; {19550#(< ~counter~0 49)} is VALID [2022-04-28 14:09:17,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,066 INFO L290 TraceCheckUtils]: 97: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,066 INFO L290 TraceCheckUtils]: 96: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,066 INFO L272 TraceCheckUtils]: 95: Hoare triple {19550#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,067 INFO L290 TraceCheckUtils]: 94: Hoare triple {19550#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {19550#(< ~counter~0 49)} is VALID [2022-04-28 14:09:17,067 INFO L290 TraceCheckUtils]: 93: Hoare triple {19578#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19550#(< ~counter~0 49)} is VALID [2022-04-28 14:09:17,067 INFO L290 TraceCheckUtils]: 92: Hoare triple {19578#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19578#(< ~counter~0 48)} is VALID [2022-04-28 14:09:17,068 INFO L290 TraceCheckUtils]: 91: Hoare triple {19578#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {19578#(< ~counter~0 48)} is VALID [2022-04-28 14:09:17,068 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19140#true} {19578#(< ~counter~0 48)} #71#return; {19578#(< ~counter~0 48)} is VALID [2022-04-28 14:09:17,068 INFO L290 TraceCheckUtils]: 89: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,068 INFO L290 TraceCheckUtils]: 88: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,068 INFO L290 TraceCheckUtils]: 87: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,068 INFO L272 TraceCheckUtils]: 86: Hoare triple {19578#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {19578#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {19578#(< ~counter~0 48)} is VALID [2022-04-28 14:09:17,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {19606#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19578#(< ~counter~0 48)} is VALID [2022-04-28 14:09:17,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {19606#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19606#(< ~counter~0 47)} is VALID [2022-04-28 14:09:17,070 INFO L290 TraceCheckUtils]: 82: Hoare triple {19606#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {19606#(< ~counter~0 47)} is VALID [2022-04-28 14:09:17,070 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19140#true} {19606#(< ~counter~0 47)} #71#return; {19606#(< ~counter~0 47)} is VALID [2022-04-28 14:09:17,070 INFO L290 TraceCheckUtils]: 80: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,070 INFO L290 TraceCheckUtils]: 79: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,071 INFO L290 TraceCheckUtils]: 78: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,071 INFO L272 TraceCheckUtils]: 77: Hoare triple {19606#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,071 INFO L290 TraceCheckUtils]: 76: Hoare triple {19606#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {19606#(< ~counter~0 47)} is VALID [2022-04-28 14:09:17,071 INFO L290 TraceCheckUtils]: 75: Hoare triple {19634#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19606#(< ~counter~0 47)} is VALID [2022-04-28 14:09:17,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {19634#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19634#(< ~counter~0 46)} is VALID [2022-04-28 14:09:17,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {19634#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {19634#(< ~counter~0 46)} is VALID [2022-04-28 14:09:17,072 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19140#true} {19634#(< ~counter~0 46)} #71#return; {19634#(< ~counter~0 46)} is VALID [2022-04-28 14:09:17,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,073 INFO L272 TraceCheckUtils]: 68: Hoare triple {19634#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,073 INFO L290 TraceCheckUtils]: 67: Hoare triple {19634#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {19634#(< ~counter~0 46)} is VALID [2022-04-28 14:09:17,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {19662#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19634#(< ~counter~0 46)} is VALID [2022-04-28 14:09:17,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {19662#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19662#(< ~counter~0 45)} is VALID [2022-04-28 14:09:17,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {19662#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {19662#(< ~counter~0 45)} is VALID [2022-04-28 14:09:17,075 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19140#true} {19662#(< ~counter~0 45)} #71#return; {19662#(< ~counter~0 45)} is VALID [2022-04-28 14:09:17,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,075 INFO L272 TraceCheckUtils]: 59: Hoare triple {19662#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {19662#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {19662#(< ~counter~0 45)} is VALID [2022-04-28 14:09:17,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {19690#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19662#(< ~counter~0 45)} is VALID [2022-04-28 14:09:17,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {19690#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19690#(< ~counter~0 44)} is VALID [2022-04-28 14:09:17,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {19690#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {19690#(< ~counter~0 44)} is VALID [2022-04-28 14:09:17,077 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19140#true} {19690#(< ~counter~0 44)} #71#return; {19690#(< ~counter~0 44)} is VALID [2022-04-28 14:09:17,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,077 INFO L272 TraceCheckUtils]: 50: Hoare triple {19690#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {19690#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {19690#(< ~counter~0 44)} is VALID [2022-04-28 14:09:17,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {19718#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19690#(< ~counter~0 44)} is VALID [2022-04-28 14:09:17,084 INFO L290 TraceCheckUtils]: 47: Hoare triple {19718#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19718#(< ~counter~0 43)} is VALID [2022-04-28 14:09:17,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {19718#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {19718#(< ~counter~0 43)} is VALID [2022-04-28 14:09:17,085 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19140#true} {19718#(< ~counter~0 43)} #71#return; {19718#(< ~counter~0 43)} is VALID [2022-04-28 14:09:17,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,085 INFO L272 TraceCheckUtils]: 41: Hoare triple {19718#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {19718#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {19718#(< ~counter~0 43)} is VALID [2022-04-28 14:09:17,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {19746#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19718#(< ~counter~0 43)} is VALID [2022-04-28 14:09:17,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {19746#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19746#(< ~counter~0 42)} is VALID [2022-04-28 14:09:17,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {19746#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {19746#(< ~counter~0 42)} is VALID [2022-04-28 14:09:17,087 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19140#true} {19746#(< ~counter~0 42)} #71#return; {19746#(< ~counter~0 42)} is VALID [2022-04-28 14:09:17,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,088 INFO L272 TraceCheckUtils]: 32: Hoare triple {19746#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {19746#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {19746#(< ~counter~0 42)} is VALID [2022-04-28 14:09:17,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {19774#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19746#(< ~counter~0 42)} is VALID [2022-04-28 14:09:17,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {19774#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19774#(< ~counter~0 41)} is VALID [2022-04-28 14:09:17,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {19774#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {19774#(< ~counter~0 41)} is VALID [2022-04-28 14:09:17,089 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19140#true} {19774#(< ~counter~0 41)} #71#return; {19774#(< ~counter~0 41)} is VALID [2022-04-28 14:09:17,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,090 INFO L272 TraceCheckUtils]: 23: Hoare triple {19774#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {19774#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {19774#(< ~counter~0 41)} is VALID [2022-04-28 14:09:17,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {19802#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19774#(< ~counter~0 41)} is VALID [2022-04-28 14:09:17,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {19802#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19802#(< ~counter~0 40)} is VALID [2022-04-28 14:09:17,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {19802#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {19802#(< ~counter~0 40)} is VALID [2022-04-28 14:09:17,092 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19140#true} {19802#(< ~counter~0 40)} #71#return; {19802#(< ~counter~0 40)} is VALID [2022-04-28 14:09:17,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,092 INFO L272 TraceCheckUtils]: 14: Hoare triple {19802#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {19802#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {19802#(< ~counter~0 40)} is VALID [2022-04-28 14:09:17,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {19830#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19802#(< ~counter~0 40)} is VALID [2022-04-28 14:09:17,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {19830#(< ~counter~0 39)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19140#true} {19830#(< ~counter~0 39)} #69#return; {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {19140#true} assume true; {19140#true} is VALID [2022-04-28 14:09:17,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {19140#true} assume !(0 == ~cond); {19140#true} is VALID [2022-04-28 14:09:17,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {19140#true} ~cond := #in~cond; {19140#true} is VALID [2022-04-28 14:09:17,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {19830#(< ~counter~0 39)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19140#true} is VALID [2022-04-28 14:09:17,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {19830#(< ~counter~0 39)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {19830#(< ~counter~0 39)} call #t~ret7 := main(); {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19830#(< ~counter~0 39)} {19140#true} #77#return; {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {19830#(< ~counter~0 39)} assume true; {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {19140#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19830#(< ~counter~0 39)} is VALID [2022-04-28 14:09:17,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {19140#true} call ULTIMATE.init(); {19140#true} is VALID [2022-04-28 14:09:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 22 proven. 297 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 14:09:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439017538] [2022-04-28 14:09:17,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041732547] [2022-04-28 14:09:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041732547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:17,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:17,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 14:09:17,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828661554] [2022-04-28 14:09:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828661554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:17,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:17,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:09:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372662630] [2022-04-28 14:09:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 117 [2022-04-28 14:09:17,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:17,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:09:17,182 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-28 14:09:17,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:09:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:17,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:09:17,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 14:09:17,183 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:09:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:17,888 INFO L93 Difference]: Finished difference Result 172 states and 211 transitions. [2022-04-28 14:09:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 14:09:17,888 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 117 [2022-04-28 14:09:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:09:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 197 transitions. [2022-04-28 14:09:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:09:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 197 transitions. [2022-04-28 14:09:17,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 197 transitions. [2022-04-28 14:09:18,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:18,082 INFO L225 Difference]: With dead ends: 172 [2022-04-28 14:09:18,082 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 14:09:18,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=855, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 14:09:18,083 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 127 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:18,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 226 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:09:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 14:09:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-28 14:09:18,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:18,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:18,429 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:18,430 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:18,432 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-04-28 14:09:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-28 14:09:18,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:18,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:18,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 164 states. [2022-04-28 14:09:18,433 INFO L87 Difference]: Start difference. First operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 164 states. [2022-04-28 14:09:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:18,436 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-04-28 14:09:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-28 14:09:18,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:18,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:18,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:18,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:09:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2022-04-28 14:09:18,439 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 117 [2022-04-28 14:09:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:18,439 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2022-04-28 14:09:18,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:09:18,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 202 transitions. [2022-04-28 14:09:42,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 191 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-28 14:09:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 14:09:42,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:42,324 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:09:42,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 14:09:42,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 14:09:42,531 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash -206022918, now seen corresponding path program 23 times [2022-04-28 14:09:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:42,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954727021] [2022-04-28 14:09:48,587 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:09:48,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:09:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash -206022918, now seen corresponding path program 24 times [2022-04-28 14:09:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:48,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195574634] [2022-04-28 14:09:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:48,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93268696] [2022-04-28 14:09:48,607 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:09:48,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:48,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:48,616 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:09:48,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 14:09:48,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 14:09:48,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:48,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 14:09:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:48,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:49,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {20891#true} call ULTIMATE.init(); {20891#true} is VALID [2022-04-28 14:09:49,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {20891#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {20899#(<= ~counter~0 0)} assume true; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20899#(<= ~counter~0 0)} {20891#true} #77#return; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {20899#(<= ~counter~0 0)} call #t~ret7 := main(); {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {20899#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {20899#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {20899#(<= ~counter~0 0)} ~cond := #in~cond; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {20899#(<= ~counter~0 0)} assume !(0 == ~cond); {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {20899#(<= ~counter~0 0)} assume true; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20899#(<= ~counter~0 0)} {20899#(<= ~counter~0 0)} #69#return; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {20899#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {20899#(<= ~counter~0 0)} is VALID [2022-04-28 14:09:49,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {20899#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {20933#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,448 INFO L272 TraceCheckUtils]: 14: Hoare triple {20933#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {20933#(<= ~counter~0 1)} ~cond := #in~cond; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {20933#(<= ~counter~0 1)} assume !(0 == ~cond); {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {20933#(<= ~counter~0 1)} assume true; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,449 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20933#(<= ~counter~0 1)} {20933#(<= ~counter~0 1)} #71#return; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {20933#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {20933#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20933#(<= ~counter~0 1)} is VALID [2022-04-28 14:09:49,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {20933#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {20961#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,452 INFO L272 TraceCheckUtils]: 23: Hoare triple {20961#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {20961#(<= ~counter~0 2)} ~cond := #in~cond; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {20961#(<= ~counter~0 2)} assume !(0 == ~cond); {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {20961#(<= ~counter~0 2)} assume true; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,453 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20961#(<= ~counter~0 2)} {20961#(<= ~counter~0 2)} #71#return; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {20961#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {20961#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20961#(<= ~counter~0 2)} is VALID [2022-04-28 14:09:49,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {20961#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {20989#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,455 INFO L272 TraceCheckUtils]: 32: Hoare triple {20989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {20989#(<= ~counter~0 3)} ~cond := #in~cond; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {20989#(<= ~counter~0 3)} assume !(0 == ~cond); {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {20989#(<= ~counter~0 3)} assume true; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,457 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20989#(<= ~counter~0 3)} {20989#(<= ~counter~0 3)} #71#return; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {20989#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20989#(<= ~counter~0 3)} is VALID [2022-04-28 14:09:49,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {20989#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {21017#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,458 INFO L272 TraceCheckUtils]: 41: Hoare triple {21017#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {21017#(<= ~counter~0 4)} ~cond := #in~cond; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {21017#(<= ~counter~0 4)} assume !(0 == ~cond); {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {21017#(<= ~counter~0 4)} assume true; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,460 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21017#(<= ~counter~0 4)} {21017#(<= ~counter~0 4)} #71#return; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {21017#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {21017#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21017#(<= ~counter~0 4)} is VALID [2022-04-28 14:09:49,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {21017#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {21045#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,462 INFO L272 TraceCheckUtils]: 50: Hoare triple {21045#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {21045#(<= ~counter~0 5)} ~cond := #in~cond; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {21045#(<= ~counter~0 5)} assume !(0 == ~cond); {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {21045#(<= ~counter~0 5)} assume true; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,463 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21045#(<= ~counter~0 5)} {21045#(<= ~counter~0 5)} #71#return; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {21045#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {21045#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21045#(<= ~counter~0 5)} is VALID [2022-04-28 14:09:49,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {21045#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {21073#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,465 INFO L272 TraceCheckUtils]: 59: Hoare triple {21073#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {21073#(<= ~counter~0 6)} ~cond := #in~cond; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {21073#(<= ~counter~0 6)} assume !(0 == ~cond); {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {21073#(<= ~counter~0 6)} assume true; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,466 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21073#(<= ~counter~0 6)} {21073#(<= ~counter~0 6)} #71#return; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {21073#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {21073#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21073#(<= ~counter~0 6)} is VALID [2022-04-28 14:09:49,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {21073#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {21101#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,468 INFO L272 TraceCheckUtils]: 68: Hoare triple {21101#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {21101#(<= ~counter~0 7)} ~cond := #in~cond; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {21101#(<= ~counter~0 7)} assume !(0 == ~cond); {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {21101#(<= ~counter~0 7)} assume true; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,469 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21101#(<= ~counter~0 7)} {21101#(<= ~counter~0 7)} #71#return; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {21101#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {21101#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21101#(<= ~counter~0 7)} is VALID [2022-04-28 14:09:49,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {21101#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {21129#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,471 INFO L272 TraceCheckUtils]: 77: Hoare triple {21129#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {21129#(<= ~counter~0 8)} ~cond := #in~cond; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {21129#(<= ~counter~0 8)} assume !(0 == ~cond); {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {21129#(<= ~counter~0 8)} assume true; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,473 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21129#(<= ~counter~0 8)} {21129#(<= ~counter~0 8)} #71#return; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {21129#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {21129#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21129#(<= ~counter~0 8)} is VALID [2022-04-28 14:09:49,474 INFO L290 TraceCheckUtils]: 84: Hoare triple {21129#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,474 INFO L290 TraceCheckUtils]: 85: Hoare triple {21157#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,474 INFO L272 TraceCheckUtils]: 86: Hoare triple {21157#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,475 INFO L290 TraceCheckUtils]: 87: Hoare triple {21157#(<= ~counter~0 9)} ~cond := #in~cond; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,475 INFO L290 TraceCheckUtils]: 88: Hoare triple {21157#(<= ~counter~0 9)} assume !(0 == ~cond); {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {21157#(<= ~counter~0 9)} assume true; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,476 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21157#(<= ~counter~0 9)} {21157#(<= ~counter~0 9)} #71#return; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,476 INFO L290 TraceCheckUtils]: 91: Hoare triple {21157#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,476 INFO L290 TraceCheckUtils]: 92: Hoare triple {21157#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21157#(<= ~counter~0 9)} is VALID [2022-04-28 14:09:49,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {21157#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,477 INFO L290 TraceCheckUtils]: 94: Hoare triple {21185#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,478 INFO L272 TraceCheckUtils]: 95: Hoare triple {21185#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {21185#(<= ~counter~0 10)} ~cond := #in~cond; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,478 INFO L290 TraceCheckUtils]: 97: Hoare triple {21185#(<= ~counter~0 10)} assume !(0 == ~cond); {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {21185#(<= ~counter~0 10)} assume true; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,479 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21185#(<= ~counter~0 10)} {21185#(<= ~counter~0 10)} #71#return; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,479 INFO L290 TraceCheckUtils]: 100: Hoare triple {21185#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,480 INFO L290 TraceCheckUtils]: 101: Hoare triple {21185#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21185#(<= ~counter~0 10)} is VALID [2022-04-28 14:09:49,480 INFO L290 TraceCheckUtils]: 102: Hoare triple {21185#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,480 INFO L290 TraceCheckUtils]: 103: Hoare triple {21213#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,481 INFO L272 TraceCheckUtils]: 104: Hoare triple {21213#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {21213#(<= ~counter~0 11)} ~cond := #in~cond; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {21213#(<= ~counter~0 11)} assume !(0 == ~cond); {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {21213#(<= ~counter~0 11)} assume true; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,482 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21213#(<= ~counter~0 11)} {21213#(<= ~counter~0 11)} #71#return; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,483 INFO L290 TraceCheckUtils]: 109: Hoare triple {21213#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,483 INFO L290 TraceCheckUtils]: 110: Hoare triple {21213#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21213#(<= ~counter~0 11)} is VALID [2022-04-28 14:09:49,483 INFO L290 TraceCheckUtils]: 111: Hoare triple {21213#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,484 INFO L290 TraceCheckUtils]: 112: Hoare triple {21241#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,484 INFO L272 TraceCheckUtils]: 113: Hoare triple {21241#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,484 INFO L290 TraceCheckUtils]: 114: Hoare triple {21241#(<= ~counter~0 12)} ~cond := #in~cond; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,485 INFO L290 TraceCheckUtils]: 115: Hoare triple {21241#(<= ~counter~0 12)} assume !(0 == ~cond); {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,485 INFO L290 TraceCheckUtils]: 116: Hoare triple {21241#(<= ~counter~0 12)} assume true; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,486 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {21241#(<= ~counter~0 12)} {21241#(<= ~counter~0 12)} #71#return; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,486 INFO L290 TraceCheckUtils]: 118: Hoare triple {21241#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,486 INFO L290 TraceCheckUtils]: 119: Hoare triple {21241#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21241#(<= ~counter~0 12)} is VALID [2022-04-28 14:09:49,486 INFO L290 TraceCheckUtils]: 120: Hoare triple {21241#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21269#(<= |main_#t~post6| 12)} is VALID [2022-04-28 14:09:49,487 INFO L290 TraceCheckUtils]: 121: Hoare triple {21269#(<= |main_#t~post6| 12)} assume !(#t~post6 < 50);havoc #t~post6; {20892#false} is VALID [2022-04-28 14:09:49,487 INFO L272 TraceCheckUtils]: 122: Hoare triple {20892#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {20892#false} is VALID [2022-04-28 14:09:49,487 INFO L290 TraceCheckUtils]: 123: Hoare triple {20892#false} ~cond := #in~cond; {20892#false} is VALID [2022-04-28 14:09:49,487 INFO L290 TraceCheckUtils]: 124: Hoare triple {20892#false} assume 0 == ~cond; {20892#false} is VALID [2022-04-28 14:09:49,487 INFO L290 TraceCheckUtils]: 125: Hoare triple {20892#false} assume !false; {20892#false} is VALID [2022-04-28 14:09:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 24 proven. 618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:09:49,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:50,180 INFO L290 TraceCheckUtils]: 125: Hoare triple {20892#false} assume !false; {20892#false} is VALID [2022-04-28 14:09:50,181 INFO L290 TraceCheckUtils]: 124: Hoare triple {20892#false} assume 0 == ~cond; {20892#false} is VALID [2022-04-28 14:09:50,181 INFO L290 TraceCheckUtils]: 123: Hoare triple {20892#false} ~cond := #in~cond; {20892#false} is VALID [2022-04-28 14:09:50,181 INFO L272 TraceCheckUtils]: 122: Hoare triple {20892#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {20892#false} is VALID [2022-04-28 14:09:50,181 INFO L290 TraceCheckUtils]: 121: Hoare triple {21297#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {20892#false} is VALID [2022-04-28 14:09:50,181 INFO L290 TraceCheckUtils]: 120: Hoare triple {21301#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21297#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:09:50,182 INFO L290 TraceCheckUtils]: 119: Hoare triple {21301#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21301#(< ~counter~0 50)} is VALID [2022-04-28 14:09:50,182 INFO L290 TraceCheckUtils]: 118: Hoare triple {21301#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {21301#(< ~counter~0 50)} is VALID [2022-04-28 14:09:50,183 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {20891#true} {21301#(< ~counter~0 50)} #71#return; {21301#(< ~counter~0 50)} is VALID [2022-04-28 14:09:50,183 INFO L290 TraceCheckUtils]: 116: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,183 INFO L290 TraceCheckUtils]: 115: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,183 INFO L290 TraceCheckUtils]: 114: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,183 INFO L272 TraceCheckUtils]: 113: Hoare triple {21301#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,183 INFO L290 TraceCheckUtils]: 112: Hoare triple {21301#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {21301#(< ~counter~0 50)} is VALID [2022-04-28 14:09:50,184 INFO L290 TraceCheckUtils]: 111: Hoare triple {21329#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21301#(< ~counter~0 50)} is VALID [2022-04-28 14:09:50,184 INFO L290 TraceCheckUtils]: 110: Hoare triple {21329#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21329#(< ~counter~0 49)} is VALID [2022-04-28 14:09:50,184 INFO L290 TraceCheckUtils]: 109: Hoare triple {21329#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {21329#(< ~counter~0 49)} is VALID [2022-04-28 14:09:50,185 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20891#true} {21329#(< ~counter~0 49)} #71#return; {21329#(< ~counter~0 49)} is VALID [2022-04-28 14:09:50,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,185 INFO L272 TraceCheckUtils]: 104: Hoare triple {21329#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,186 INFO L290 TraceCheckUtils]: 103: Hoare triple {21329#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {21329#(< ~counter~0 49)} is VALID [2022-04-28 14:09:50,186 INFO L290 TraceCheckUtils]: 102: Hoare triple {21357#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21329#(< ~counter~0 49)} is VALID [2022-04-28 14:09:50,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {21357#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21357#(< ~counter~0 48)} is VALID [2022-04-28 14:09:50,187 INFO L290 TraceCheckUtils]: 100: Hoare triple {21357#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {21357#(< ~counter~0 48)} is VALID [2022-04-28 14:09:50,187 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {20891#true} {21357#(< ~counter~0 48)} #71#return; {21357#(< ~counter~0 48)} is VALID [2022-04-28 14:09:50,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,188 INFO L272 TraceCheckUtils]: 95: Hoare triple {21357#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,188 INFO L290 TraceCheckUtils]: 94: Hoare triple {21357#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {21357#(< ~counter~0 48)} is VALID [2022-04-28 14:09:50,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {21385#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21357#(< ~counter~0 48)} is VALID [2022-04-28 14:09:50,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {21385#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21385#(< ~counter~0 47)} is VALID [2022-04-28 14:09:50,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {21385#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {21385#(< ~counter~0 47)} is VALID [2022-04-28 14:09:50,189 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20891#true} {21385#(< ~counter~0 47)} #71#return; {21385#(< ~counter~0 47)} is VALID [2022-04-28 14:09:50,189 INFO L290 TraceCheckUtils]: 89: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,190 INFO L290 TraceCheckUtils]: 87: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,190 INFO L272 TraceCheckUtils]: 86: Hoare triple {21385#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,190 INFO L290 TraceCheckUtils]: 85: Hoare triple {21385#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {21385#(< ~counter~0 47)} is VALID [2022-04-28 14:09:50,190 INFO L290 TraceCheckUtils]: 84: Hoare triple {21413#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21385#(< ~counter~0 47)} is VALID [2022-04-28 14:09:50,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {21413#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21413#(< ~counter~0 46)} is VALID [2022-04-28 14:09:50,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {21413#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {21413#(< ~counter~0 46)} is VALID [2022-04-28 14:09:50,192 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20891#true} {21413#(< ~counter~0 46)} #71#return; {21413#(< ~counter~0 46)} is VALID [2022-04-28 14:09:50,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,192 INFO L290 TraceCheckUtils]: 78: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,192 INFO L272 TraceCheckUtils]: 77: Hoare triple {21413#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,192 INFO L290 TraceCheckUtils]: 76: Hoare triple {21413#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {21413#(< ~counter~0 46)} is VALID [2022-04-28 14:09:50,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {21441#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21413#(< ~counter~0 46)} is VALID [2022-04-28 14:09:50,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {21441#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21441#(< ~counter~0 45)} is VALID [2022-04-28 14:09:50,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {21441#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {21441#(< ~counter~0 45)} is VALID [2022-04-28 14:09:50,194 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {20891#true} {21441#(< ~counter~0 45)} #71#return; {21441#(< ~counter~0 45)} is VALID [2022-04-28 14:09:50,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,194 INFO L290 TraceCheckUtils]: 69: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,194 INFO L272 TraceCheckUtils]: 68: Hoare triple {21441#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,194 INFO L290 TraceCheckUtils]: 67: Hoare triple {21441#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {21441#(< ~counter~0 45)} is VALID [2022-04-28 14:09:50,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {21469#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21441#(< ~counter~0 45)} is VALID [2022-04-28 14:09:50,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {21469#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21469#(< ~counter~0 44)} is VALID [2022-04-28 14:09:50,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {21469#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {21469#(< ~counter~0 44)} is VALID [2022-04-28 14:09:50,196 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20891#true} {21469#(< ~counter~0 44)} #71#return; {21469#(< ~counter~0 44)} is VALID [2022-04-28 14:09:50,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,196 INFO L272 TraceCheckUtils]: 59: Hoare triple {21469#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {21469#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {21469#(< ~counter~0 44)} is VALID [2022-04-28 14:09:50,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {21497#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21469#(< ~counter~0 44)} is VALID [2022-04-28 14:09:50,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {21497#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21497#(< ~counter~0 43)} is VALID [2022-04-28 14:09:50,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {21497#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {21497#(< ~counter~0 43)} is VALID [2022-04-28 14:09:50,198 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20891#true} {21497#(< ~counter~0 43)} #71#return; {21497#(< ~counter~0 43)} is VALID [2022-04-28 14:09:50,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,198 INFO L272 TraceCheckUtils]: 50: Hoare triple {21497#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {21497#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {21497#(< ~counter~0 43)} is VALID [2022-04-28 14:09:50,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {21525#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21497#(< ~counter~0 43)} is VALID [2022-04-28 14:09:50,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {21525#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21525#(< ~counter~0 42)} is VALID [2022-04-28 14:09:50,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {21525#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {21525#(< ~counter~0 42)} is VALID [2022-04-28 14:09:50,200 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20891#true} {21525#(< ~counter~0 42)} #71#return; {21525#(< ~counter~0 42)} is VALID [2022-04-28 14:09:50,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,200 INFO L272 TraceCheckUtils]: 41: Hoare triple {21525#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {21525#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {21525#(< ~counter~0 42)} is VALID [2022-04-28 14:09:50,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {21553#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21525#(< ~counter~0 42)} is VALID [2022-04-28 14:09:50,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {21553#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21553#(< ~counter~0 41)} is VALID [2022-04-28 14:09:50,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {21553#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {21553#(< ~counter~0 41)} is VALID [2022-04-28 14:09:50,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20891#true} {21553#(< ~counter~0 41)} #71#return; {21553#(< ~counter~0 41)} is VALID [2022-04-28 14:09:50,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,203 INFO L272 TraceCheckUtils]: 32: Hoare triple {21553#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {21553#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {21553#(< ~counter~0 41)} is VALID [2022-04-28 14:09:50,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21553#(< ~counter~0 41)} is VALID [2022-04-28 14:09:50,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {21581#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21581#(< ~counter~0 40)} is VALID [2022-04-28 14:09:50,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {21581#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {21581#(< ~counter~0 40)} is VALID [2022-04-28 14:09:50,205 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20891#true} {21581#(< ~counter~0 40)} #71#return; {21581#(< ~counter~0 40)} is VALID [2022-04-28 14:09:50,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,205 INFO L272 TraceCheckUtils]: 23: Hoare triple {21581#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {21581#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {21581#(< ~counter~0 40)} is VALID [2022-04-28 14:09:50,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {21609#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21581#(< ~counter~0 40)} is VALID [2022-04-28 14:09:50,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {21609#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21609#(< ~counter~0 39)} is VALID [2022-04-28 14:09:50,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {21609#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {21609#(< ~counter~0 39)} is VALID [2022-04-28 14:09:50,207 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20891#true} {21609#(< ~counter~0 39)} #71#return; {21609#(< ~counter~0 39)} is VALID [2022-04-28 14:09:50,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,207 INFO L272 TraceCheckUtils]: 14: Hoare triple {21609#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {21609#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {21609#(< ~counter~0 39)} is VALID [2022-04-28 14:09:50,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {21637#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21609#(< ~counter~0 39)} is VALID [2022-04-28 14:09:50,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {21637#(< ~counter~0 38)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20891#true} {21637#(< ~counter~0 38)} #69#return; {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {20891#true} assume true; {20891#true} is VALID [2022-04-28 14:09:50,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {20891#true} assume !(0 == ~cond); {20891#true} is VALID [2022-04-28 14:09:50,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {20891#true} ~cond := #in~cond; {20891#true} is VALID [2022-04-28 14:09:50,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {21637#(< ~counter~0 38)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20891#true} is VALID [2022-04-28 14:09:50,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {21637#(< ~counter~0 38)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {21637#(< ~counter~0 38)} call #t~ret7 := main(); {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21637#(< ~counter~0 38)} {20891#true} #77#return; {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {21637#(< ~counter~0 38)} assume true; {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {20891#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21637#(< ~counter~0 38)} is VALID [2022-04-28 14:09:50,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {20891#true} call ULTIMATE.init(); {20891#true} is VALID [2022-04-28 14:09:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 24 proven. 354 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 14:09:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:50,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195574634] [2022-04-28 14:09:50,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:50,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93268696] [2022-04-28 14:09:50,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93268696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:50,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:50,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 14:09:50,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:50,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954727021] [2022-04-28 14:09:50,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954727021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:50,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:50,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:09:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389110662] [2022-04-28 14:09:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 126 [2022-04-28 14:09:50,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:50,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:09:50,302 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-28 14:09:50,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:09:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:09:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 14:09:50,303 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:09:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:51,029 INFO L93 Difference]: Finished difference Result 183 states and 225 transitions. [2022-04-28 14:09:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 14:09:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 126 [2022-04-28 14:09:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:09:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 211 transitions. [2022-04-28 14:09:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:09:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 211 transitions. [2022-04-28 14:09:51,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 211 transitions. [2022-04-28 14:09:51,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:09:51,202 INFO L225 Difference]: With dead ends: 183 [2022-04-28 14:09:51,202 INFO L226 Difference]: Without dead ends: 175 [2022-04-28 14:09:51,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=731, Invalid=991, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 14:09:51,203 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 121 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:51,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 246 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:09:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-28 14:09:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-04-28 14:09:51,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:51,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:51,505 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:51,505 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:51,508 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-04-28 14:09:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-28 14:09:51,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:51,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:51,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 175 states. [2022-04-28 14:09:51,509 INFO L87 Difference]: Start difference. First operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 175 states. [2022-04-28 14:09:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:51,511 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-04-28 14:09:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-28 14:09:51,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:51,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:51,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:51,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:09:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2022-04-28 14:09:51,515 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 126 [2022-04-28 14:09:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:51,516 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2022-04-28 14:09:51,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:09:51,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 216 transitions. [2022-04-28 14:10:17,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 204 inductive. 0 not inductive. 12 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-28 14:10:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 14:10:17,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:10:17,607 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:10:17,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 14:10:17,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 14:10:17,807 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:10:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:10:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1923626174, now seen corresponding path program 25 times [2022-04-28 14:10:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:17,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459780007] [2022-04-28 14:10:23,861 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:10:23,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:10:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1923626174, now seen corresponding path program 26 times [2022-04-28 14:10:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:10:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641838687] [2022-04-28 14:10:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:10:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:10:23,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:10:23,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333102120] [2022-04-28 14:10:23,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:10:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:10:23,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:10:23,891 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:10:23,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 14:10:23,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:10:23,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:10:23,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 14:10:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:10:24,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:10:24,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {22766#true} call ULTIMATE.init(); {22766#true} is VALID [2022-04-28 14:10:24,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {22766#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {22774#(<= ~counter~0 0)} assume true; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22774#(<= ~counter~0 0)} {22766#true} #77#return; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {22774#(<= ~counter~0 0)} call #t~ret7 := main(); {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {22774#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {22774#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {22774#(<= ~counter~0 0)} ~cond := #in~cond; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {22774#(<= ~counter~0 0)} assume !(0 == ~cond); {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {22774#(<= ~counter~0 0)} assume true; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22774#(<= ~counter~0 0)} {22774#(<= ~counter~0 0)} #69#return; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {22774#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {22774#(<= ~counter~0 0)} is VALID [2022-04-28 14:10:24,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {22774#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {22808#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,675 INFO L272 TraceCheckUtils]: 14: Hoare triple {22808#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {22808#(<= ~counter~0 1)} ~cond := #in~cond; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {22808#(<= ~counter~0 1)} assume !(0 == ~cond); {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {22808#(<= ~counter~0 1)} assume true; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,677 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22808#(<= ~counter~0 1)} {22808#(<= ~counter~0 1)} #71#return; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {22808#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {22808#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22808#(<= ~counter~0 1)} is VALID [2022-04-28 14:10:24,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {22808#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {22836#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,679 INFO L272 TraceCheckUtils]: 23: Hoare triple {22836#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {22836#(<= ~counter~0 2)} ~cond := #in~cond; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {22836#(<= ~counter~0 2)} assume !(0 == ~cond); {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {22836#(<= ~counter~0 2)} assume true; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,680 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22836#(<= ~counter~0 2)} {22836#(<= ~counter~0 2)} #71#return; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {22836#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {22836#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22836#(<= ~counter~0 2)} is VALID [2022-04-28 14:10:24,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {22836#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {22864#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,682 INFO L272 TraceCheckUtils]: 32: Hoare triple {22864#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {22864#(<= ~counter~0 3)} ~cond := #in~cond; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {22864#(<= ~counter~0 3)} assume !(0 == ~cond); {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {22864#(<= ~counter~0 3)} assume true; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,683 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22864#(<= ~counter~0 3)} {22864#(<= ~counter~0 3)} #71#return; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {22864#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {22864#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22864#(<= ~counter~0 3)} is VALID [2022-04-28 14:10:24,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {22864#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {22892#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,685 INFO L272 TraceCheckUtils]: 41: Hoare triple {22892#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {22892#(<= ~counter~0 4)} ~cond := #in~cond; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {22892#(<= ~counter~0 4)} assume !(0 == ~cond); {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {22892#(<= ~counter~0 4)} assume true; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,686 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22892#(<= ~counter~0 4)} {22892#(<= ~counter~0 4)} #71#return; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {22892#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22892#(<= ~counter~0 4)} is VALID [2022-04-28 14:10:24,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {22920#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,688 INFO L272 TraceCheckUtils]: 50: Hoare triple {22920#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {22920#(<= ~counter~0 5)} ~cond := #in~cond; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {22920#(<= ~counter~0 5)} assume !(0 == ~cond); {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {22920#(<= ~counter~0 5)} assume true; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,694 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22920#(<= ~counter~0 5)} {22920#(<= ~counter~0 5)} #71#return; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {22920#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {22920#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22920#(<= ~counter~0 5)} is VALID [2022-04-28 14:10:24,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {22920#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {22948#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,701 INFO L272 TraceCheckUtils]: 59: Hoare triple {22948#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {22948#(<= ~counter~0 6)} ~cond := #in~cond; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {22948#(<= ~counter~0 6)} assume !(0 == ~cond); {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {22948#(<= ~counter~0 6)} assume true; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,703 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22948#(<= ~counter~0 6)} {22948#(<= ~counter~0 6)} #71#return; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {22948#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {22948#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22948#(<= ~counter~0 6)} is VALID [2022-04-28 14:10:24,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {22948#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,704 INFO L290 TraceCheckUtils]: 67: Hoare triple {22976#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,705 INFO L272 TraceCheckUtils]: 68: Hoare triple {22976#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {22976#(<= ~counter~0 7)} ~cond := #in~cond; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,706 INFO L290 TraceCheckUtils]: 70: Hoare triple {22976#(<= ~counter~0 7)} assume !(0 == ~cond); {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,706 INFO L290 TraceCheckUtils]: 71: Hoare triple {22976#(<= ~counter~0 7)} assume true; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,707 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22976#(<= ~counter~0 7)} {22976#(<= ~counter~0 7)} #71#return; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {22976#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,708 INFO L290 TraceCheckUtils]: 74: Hoare triple {22976#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22976#(<= ~counter~0 7)} is VALID [2022-04-28 14:10:24,708 INFO L290 TraceCheckUtils]: 75: Hoare triple {22976#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,708 INFO L290 TraceCheckUtils]: 76: Hoare triple {23004#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,709 INFO L272 TraceCheckUtils]: 77: Hoare triple {23004#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {23004#(<= ~counter~0 8)} ~cond := #in~cond; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {23004#(<= ~counter~0 8)} assume !(0 == ~cond); {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,710 INFO L290 TraceCheckUtils]: 80: Hoare triple {23004#(<= ~counter~0 8)} assume true; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,711 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23004#(<= ~counter~0 8)} {23004#(<= ~counter~0 8)} #71#return; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {23004#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,712 INFO L290 TraceCheckUtils]: 83: Hoare triple {23004#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23004#(<= ~counter~0 8)} is VALID [2022-04-28 14:10:24,712 INFO L290 TraceCheckUtils]: 84: Hoare triple {23004#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,713 INFO L290 TraceCheckUtils]: 85: Hoare triple {23032#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,713 INFO L272 TraceCheckUtils]: 86: Hoare triple {23032#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {23032#(<= ~counter~0 9)} ~cond := #in~cond; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {23032#(<= ~counter~0 9)} assume !(0 == ~cond); {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,714 INFO L290 TraceCheckUtils]: 89: Hoare triple {23032#(<= ~counter~0 9)} assume true; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,715 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23032#(<= ~counter~0 9)} {23032#(<= ~counter~0 9)} #71#return; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,716 INFO L290 TraceCheckUtils]: 91: Hoare triple {23032#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,716 INFO L290 TraceCheckUtils]: 92: Hoare triple {23032#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23032#(<= ~counter~0 9)} is VALID [2022-04-28 14:10:24,716 INFO L290 TraceCheckUtils]: 93: Hoare triple {23032#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,717 INFO L290 TraceCheckUtils]: 94: Hoare triple {23060#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,718 INFO L272 TraceCheckUtils]: 95: Hoare triple {23060#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,718 INFO L290 TraceCheckUtils]: 96: Hoare triple {23060#(<= ~counter~0 10)} ~cond := #in~cond; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,718 INFO L290 TraceCheckUtils]: 97: Hoare triple {23060#(<= ~counter~0 10)} assume !(0 == ~cond); {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,719 INFO L290 TraceCheckUtils]: 98: Hoare triple {23060#(<= ~counter~0 10)} assume true; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,719 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23060#(<= ~counter~0 10)} {23060#(<= ~counter~0 10)} #71#return; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,720 INFO L290 TraceCheckUtils]: 100: Hoare triple {23060#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,720 INFO L290 TraceCheckUtils]: 101: Hoare triple {23060#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23060#(<= ~counter~0 10)} is VALID [2022-04-28 14:10:24,720 INFO L290 TraceCheckUtils]: 102: Hoare triple {23060#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,721 INFO L290 TraceCheckUtils]: 103: Hoare triple {23088#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,721 INFO L272 TraceCheckUtils]: 104: Hoare triple {23088#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {23088#(<= ~counter~0 11)} ~cond := #in~cond; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,722 INFO L290 TraceCheckUtils]: 106: Hoare triple {23088#(<= ~counter~0 11)} assume !(0 == ~cond); {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,722 INFO L290 TraceCheckUtils]: 107: Hoare triple {23088#(<= ~counter~0 11)} assume true; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,723 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23088#(<= ~counter~0 11)} {23088#(<= ~counter~0 11)} #71#return; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,723 INFO L290 TraceCheckUtils]: 109: Hoare triple {23088#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,724 INFO L290 TraceCheckUtils]: 110: Hoare triple {23088#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23088#(<= ~counter~0 11)} is VALID [2022-04-28 14:10:24,724 INFO L290 TraceCheckUtils]: 111: Hoare triple {23088#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,725 INFO L290 TraceCheckUtils]: 112: Hoare triple {23116#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,725 INFO L272 TraceCheckUtils]: 113: Hoare triple {23116#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,726 INFO L290 TraceCheckUtils]: 114: Hoare triple {23116#(<= ~counter~0 12)} ~cond := #in~cond; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,726 INFO L290 TraceCheckUtils]: 115: Hoare triple {23116#(<= ~counter~0 12)} assume !(0 == ~cond); {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,726 INFO L290 TraceCheckUtils]: 116: Hoare triple {23116#(<= ~counter~0 12)} assume true; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,727 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23116#(<= ~counter~0 12)} {23116#(<= ~counter~0 12)} #71#return; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,727 INFO L290 TraceCheckUtils]: 118: Hoare triple {23116#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,728 INFO L290 TraceCheckUtils]: 119: Hoare triple {23116#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23116#(<= ~counter~0 12)} is VALID [2022-04-28 14:10:24,728 INFO L290 TraceCheckUtils]: 120: Hoare triple {23116#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,728 INFO L290 TraceCheckUtils]: 121: Hoare triple {23144#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,729 INFO L272 TraceCheckUtils]: 122: Hoare triple {23144#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,730 INFO L290 TraceCheckUtils]: 123: Hoare triple {23144#(<= ~counter~0 13)} ~cond := #in~cond; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,730 INFO L290 TraceCheckUtils]: 124: Hoare triple {23144#(<= ~counter~0 13)} assume !(0 == ~cond); {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,730 INFO L290 TraceCheckUtils]: 125: Hoare triple {23144#(<= ~counter~0 13)} assume true; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,731 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {23144#(<= ~counter~0 13)} {23144#(<= ~counter~0 13)} #71#return; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,731 INFO L290 TraceCheckUtils]: 127: Hoare triple {23144#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,732 INFO L290 TraceCheckUtils]: 128: Hoare triple {23144#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23144#(<= ~counter~0 13)} is VALID [2022-04-28 14:10:24,732 INFO L290 TraceCheckUtils]: 129: Hoare triple {23144#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23172#(<= |main_#t~post6| 13)} is VALID [2022-04-28 14:10:24,733 INFO L290 TraceCheckUtils]: 130: Hoare triple {23172#(<= |main_#t~post6| 13)} assume !(#t~post6 < 50);havoc #t~post6; {22767#false} is VALID [2022-04-28 14:10:24,733 INFO L272 TraceCheckUtils]: 131: Hoare triple {22767#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {22767#false} is VALID [2022-04-28 14:10:24,733 INFO L290 TraceCheckUtils]: 132: Hoare triple {22767#false} ~cond := #in~cond; {22767#false} is VALID [2022-04-28 14:10:24,733 INFO L290 TraceCheckUtils]: 133: Hoare triple {22767#false} assume 0 == ~cond; {22767#false} is VALID [2022-04-28 14:10:24,733 INFO L290 TraceCheckUtils]: 134: Hoare triple {22767#false} assume !false; {22767#false} is VALID [2022-04-28 14:10:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 26 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:10:24,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:10:25,568 INFO L290 TraceCheckUtils]: 134: Hoare triple {22767#false} assume !false; {22767#false} is VALID [2022-04-28 14:10:25,568 INFO L290 TraceCheckUtils]: 133: Hoare triple {22767#false} assume 0 == ~cond; {22767#false} is VALID [2022-04-28 14:10:25,568 INFO L290 TraceCheckUtils]: 132: Hoare triple {22767#false} ~cond := #in~cond; {22767#false} is VALID [2022-04-28 14:10:25,568 INFO L272 TraceCheckUtils]: 131: Hoare triple {22767#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {22767#false} is VALID [2022-04-28 14:10:25,568 INFO L290 TraceCheckUtils]: 130: Hoare triple {23200#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {22767#false} is VALID [2022-04-28 14:10:25,569 INFO L290 TraceCheckUtils]: 129: Hoare triple {23204#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23200#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:10:25,569 INFO L290 TraceCheckUtils]: 128: Hoare triple {23204#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23204#(< ~counter~0 50)} is VALID [2022-04-28 14:10:25,569 INFO L290 TraceCheckUtils]: 127: Hoare triple {23204#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {23204#(< ~counter~0 50)} is VALID [2022-04-28 14:10:25,570 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22766#true} {23204#(< ~counter~0 50)} #71#return; {23204#(< ~counter~0 50)} is VALID [2022-04-28 14:10:25,570 INFO L290 TraceCheckUtils]: 125: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,570 INFO L290 TraceCheckUtils]: 124: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,570 INFO L290 TraceCheckUtils]: 123: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,570 INFO L272 TraceCheckUtils]: 122: Hoare triple {23204#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,570 INFO L290 TraceCheckUtils]: 121: Hoare triple {23204#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {23204#(< ~counter~0 50)} is VALID [2022-04-28 14:10:25,571 INFO L290 TraceCheckUtils]: 120: Hoare triple {23232#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23204#(< ~counter~0 50)} is VALID [2022-04-28 14:10:25,571 INFO L290 TraceCheckUtils]: 119: Hoare triple {23232#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23232#(< ~counter~0 49)} is VALID [2022-04-28 14:10:25,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {23232#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {23232#(< ~counter~0 49)} is VALID [2022-04-28 14:10:25,572 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {22766#true} {23232#(< ~counter~0 49)} #71#return; {23232#(< ~counter~0 49)} is VALID [2022-04-28 14:10:25,572 INFO L290 TraceCheckUtils]: 116: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,572 INFO L290 TraceCheckUtils]: 115: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,572 INFO L290 TraceCheckUtils]: 114: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,572 INFO L272 TraceCheckUtils]: 113: Hoare triple {23232#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,573 INFO L290 TraceCheckUtils]: 112: Hoare triple {23232#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {23232#(< ~counter~0 49)} is VALID [2022-04-28 14:10:25,573 INFO L290 TraceCheckUtils]: 111: Hoare triple {23260#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23232#(< ~counter~0 49)} is VALID [2022-04-28 14:10:25,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {23260#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23260#(< ~counter~0 48)} is VALID [2022-04-28 14:10:25,574 INFO L290 TraceCheckUtils]: 109: Hoare triple {23260#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {23260#(< ~counter~0 48)} is VALID [2022-04-28 14:10:25,574 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22766#true} {23260#(< ~counter~0 48)} #71#return; {23260#(< ~counter~0 48)} is VALID [2022-04-28 14:10:25,574 INFO L290 TraceCheckUtils]: 107: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,574 INFO L290 TraceCheckUtils]: 106: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,574 INFO L290 TraceCheckUtils]: 105: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,574 INFO L272 TraceCheckUtils]: 104: Hoare triple {23260#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,575 INFO L290 TraceCheckUtils]: 103: Hoare triple {23260#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {23260#(< ~counter~0 48)} is VALID [2022-04-28 14:10:25,575 INFO L290 TraceCheckUtils]: 102: Hoare triple {23288#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23260#(< ~counter~0 48)} is VALID [2022-04-28 14:10:25,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {23288#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23288#(< ~counter~0 47)} is VALID [2022-04-28 14:10:25,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {23288#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {23288#(< ~counter~0 47)} is VALID [2022-04-28 14:10:25,576 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {22766#true} {23288#(< ~counter~0 47)} #71#return; {23288#(< ~counter~0 47)} is VALID [2022-04-28 14:10:25,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,577 INFO L272 TraceCheckUtils]: 95: Hoare triple {23288#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {23288#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {23288#(< ~counter~0 47)} is VALID [2022-04-28 14:10:25,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {23316#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23288#(< ~counter~0 47)} is VALID [2022-04-28 14:10:25,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {23316#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23316#(< ~counter~0 46)} is VALID [2022-04-28 14:10:25,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {23316#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {23316#(< ~counter~0 46)} is VALID [2022-04-28 14:10:25,578 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {22766#true} {23316#(< ~counter~0 46)} #71#return; {23316#(< ~counter~0 46)} is VALID [2022-04-28 14:10:25,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,579 INFO L290 TraceCheckUtils]: 88: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,579 INFO L290 TraceCheckUtils]: 87: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,579 INFO L272 TraceCheckUtils]: 86: Hoare triple {23316#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {23316#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {23316#(< ~counter~0 46)} is VALID [2022-04-28 14:10:25,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {23344#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23316#(< ~counter~0 46)} is VALID [2022-04-28 14:10:25,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {23344#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23344#(< ~counter~0 45)} is VALID [2022-04-28 14:10:25,585 INFO L290 TraceCheckUtils]: 82: Hoare triple {23344#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {23344#(< ~counter~0 45)} is VALID [2022-04-28 14:10:25,586 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22766#true} {23344#(< ~counter~0 45)} #71#return; {23344#(< ~counter~0 45)} is VALID [2022-04-28 14:10:25,587 INFO L290 TraceCheckUtils]: 80: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,587 INFO L290 TraceCheckUtils]: 79: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,587 INFO L290 TraceCheckUtils]: 78: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,587 INFO L272 TraceCheckUtils]: 77: Hoare triple {23344#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,587 INFO L290 TraceCheckUtils]: 76: Hoare triple {23344#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {23344#(< ~counter~0 45)} is VALID [2022-04-28 14:10:25,588 INFO L290 TraceCheckUtils]: 75: Hoare triple {23372#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23344#(< ~counter~0 45)} is VALID [2022-04-28 14:10:25,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {23372#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23372#(< ~counter~0 44)} is VALID [2022-04-28 14:10:25,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {23372#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {23372#(< ~counter~0 44)} is VALID [2022-04-28 14:10:25,589 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22766#true} {23372#(< ~counter~0 44)} #71#return; {23372#(< ~counter~0 44)} is VALID [2022-04-28 14:10:25,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,590 INFO L290 TraceCheckUtils]: 70: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,590 INFO L290 TraceCheckUtils]: 69: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,590 INFO L272 TraceCheckUtils]: 68: Hoare triple {23372#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,590 INFO L290 TraceCheckUtils]: 67: Hoare triple {23372#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {23372#(< ~counter~0 44)} is VALID [2022-04-28 14:10:25,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {23400#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23372#(< ~counter~0 44)} is VALID [2022-04-28 14:10:25,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {23400#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23400#(< ~counter~0 43)} is VALID [2022-04-28 14:10:25,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {23400#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {23400#(< ~counter~0 43)} is VALID [2022-04-28 14:10:25,592 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22766#true} {23400#(< ~counter~0 43)} #71#return; {23400#(< ~counter~0 43)} is VALID [2022-04-28 14:10:25,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,592 INFO L272 TraceCheckUtils]: 59: Hoare triple {23400#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {23400#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {23400#(< ~counter~0 43)} is VALID [2022-04-28 14:10:25,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {23428#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23400#(< ~counter~0 43)} is VALID [2022-04-28 14:10:25,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {23428#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23428#(< ~counter~0 42)} is VALID [2022-04-28 14:10:25,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {23428#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {23428#(< ~counter~0 42)} is VALID [2022-04-28 14:10:25,594 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22766#true} {23428#(< ~counter~0 42)} #71#return; {23428#(< ~counter~0 42)} is VALID [2022-04-28 14:10:25,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,594 INFO L272 TraceCheckUtils]: 50: Hoare triple {23428#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {23428#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {23428#(< ~counter~0 42)} is VALID [2022-04-28 14:10:25,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {23456#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23428#(< ~counter~0 42)} is VALID [2022-04-28 14:10:25,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {23456#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23456#(< ~counter~0 41)} is VALID [2022-04-28 14:10:25,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {23456#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {23456#(< ~counter~0 41)} is VALID [2022-04-28 14:10:25,596 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22766#true} {23456#(< ~counter~0 41)} #71#return; {23456#(< ~counter~0 41)} is VALID [2022-04-28 14:10:25,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,596 INFO L272 TraceCheckUtils]: 41: Hoare triple {23456#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {23456#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {23456#(< ~counter~0 41)} is VALID [2022-04-28 14:10:25,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {23484#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23456#(< ~counter~0 41)} is VALID [2022-04-28 14:10:25,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {23484#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23484#(< ~counter~0 40)} is VALID [2022-04-28 14:10:25,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {23484#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {23484#(< ~counter~0 40)} is VALID [2022-04-28 14:10:25,598 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22766#true} {23484#(< ~counter~0 40)} #71#return; {23484#(< ~counter~0 40)} is VALID [2022-04-28 14:10:25,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,598 INFO L272 TraceCheckUtils]: 32: Hoare triple {23484#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {23484#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {23484#(< ~counter~0 40)} is VALID [2022-04-28 14:10:25,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {23512#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23484#(< ~counter~0 40)} is VALID [2022-04-28 14:10:25,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {23512#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23512#(< ~counter~0 39)} is VALID [2022-04-28 14:10:25,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {23512#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {23512#(< ~counter~0 39)} is VALID [2022-04-28 14:10:25,600 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22766#true} {23512#(< ~counter~0 39)} #71#return; {23512#(< ~counter~0 39)} is VALID [2022-04-28 14:10:25,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,600 INFO L272 TraceCheckUtils]: 23: Hoare triple {23512#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {23512#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {23512#(< ~counter~0 39)} is VALID [2022-04-28 14:10:25,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {23540#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23512#(< ~counter~0 39)} is VALID [2022-04-28 14:10:25,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {23540#(< ~counter~0 38)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23540#(< ~counter~0 38)} is VALID [2022-04-28 14:10:25,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {23540#(< ~counter~0 38)} assume !!(0 != ~a~0 && 0 != ~b~0); {23540#(< ~counter~0 38)} is VALID [2022-04-28 14:10:25,610 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22766#true} {23540#(< ~counter~0 38)} #71#return; {23540#(< ~counter~0 38)} is VALID [2022-04-28 14:10:25,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,610 INFO L272 TraceCheckUtils]: 14: Hoare triple {23540#(< ~counter~0 38)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {23540#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {23540#(< ~counter~0 38)} is VALID [2022-04-28 14:10:25,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {23568#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23540#(< ~counter~0 38)} is VALID [2022-04-28 14:10:25,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {23568#(< ~counter~0 37)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22766#true} {23568#(< ~counter~0 37)} #69#return; {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {22766#true} assume true; {22766#true} is VALID [2022-04-28 14:10:25,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {22766#true} assume !(0 == ~cond); {22766#true} is VALID [2022-04-28 14:10:25,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {22766#true} ~cond := #in~cond; {22766#true} is VALID [2022-04-28 14:10:25,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {23568#(< ~counter~0 37)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22766#true} is VALID [2022-04-28 14:10:25,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {23568#(< ~counter~0 37)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {23568#(< ~counter~0 37)} call #t~ret7 := main(); {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23568#(< ~counter~0 37)} {22766#true} #77#return; {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {23568#(< ~counter~0 37)} assume true; {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {22766#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23568#(< ~counter~0 37)} is VALID [2022-04-28 14:10:25,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {22766#true} call ULTIMATE.init(); {22766#true} is VALID [2022-04-28 14:10:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 26 proven. 416 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 14:10:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:10:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641838687] [2022-04-28 14:10:25,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:10:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333102120] [2022-04-28 14:10:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333102120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:10:25,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:10:25,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 14:10:25,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:10:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459780007] [2022-04-28 14:10:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459780007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:10:25,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:10:25,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 14:10:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791164120] [2022-04-28 14:10:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:10:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 135 [2022-04-28 14:10:25,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:10:25,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:10:25,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:25,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 14:10:25,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 14:10:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 14:10:25,724 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:10:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:26,546 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2022-04-28 14:10:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 14:10:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 135 [2022-04-28 14:10:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:10:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:10:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2022-04-28 14:10:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:10:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2022-04-28 14:10:26,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 225 transitions. [2022-04-28 14:10:26,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:26,769 INFO L225 Difference]: With dead ends: 194 [2022-04-28 14:10:26,769 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 14:10:26,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=843, Invalid=1137, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 14:10:26,770 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:10:26,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 250 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:10:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 14:10:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-28 14:10:27,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:10:27,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:27,079 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:27,079 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:27,081 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2022-04-28 14:10:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-28 14:10:27,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:27,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:27,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 186 states. [2022-04-28 14:10:27,083 INFO L87 Difference]: Start difference. First operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 186 states. [2022-04-28 14:10:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:27,085 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2022-04-28 14:10:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-28 14:10:27,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:27,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:27,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:10:27,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:10:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:10:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 230 transitions. [2022-04-28 14:10:27,089 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 230 transitions. Word has length 135 [2022-04-28 14:10:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:10:27,089 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 230 transitions. [2022-04-28 14:10:27,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:10:27,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 230 transitions. [2022-04-28 14:10:55,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 217 inductive. 0 not inductive. 13 times theorem prover too weak to decide inductivity. [2022-04-28 14:10:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-28 14:10:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 14:10:55,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:10:55,262 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:10:55,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 14:10:55,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 14:10:55,467 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:10:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:10:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1384294394, now seen corresponding path program 27 times [2022-04-28 14:10:55,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:55,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595084358] [2022-04-28 14:11:01,521 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:11:01,521 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:11:01,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1384294394, now seen corresponding path program 28 times [2022-04-28 14:11:01,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:01,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602461564] [2022-04-28 14:11:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:01,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:01,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240274004] [2022-04-28 14:11:01,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:11:01,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:01,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:01,552 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:11:01,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 14:11:01,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:11:01,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:01,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 14:11:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:01,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:02,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {24765#true} call ULTIMATE.init(); {24765#true} is VALID [2022-04-28 14:11:02,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {24765#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {24773#(<= ~counter~0 0)} assume true; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24773#(<= ~counter~0 0)} {24765#true} #77#return; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {24773#(<= ~counter~0 0)} call #t~ret7 := main(); {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {24773#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {24773#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {24773#(<= ~counter~0 0)} ~cond := #in~cond; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {24773#(<= ~counter~0 0)} assume !(0 == ~cond); {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {24773#(<= ~counter~0 0)} assume true; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24773#(<= ~counter~0 0)} {24773#(<= ~counter~0 0)} #69#return; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {24773#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {24773#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:02,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {24773#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {24807#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,387 INFO L272 TraceCheckUtils]: 14: Hoare triple {24807#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {24807#(<= ~counter~0 1)} ~cond := #in~cond; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {24807#(<= ~counter~0 1)} assume !(0 == ~cond); {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {24807#(<= ~counter~0 1)} assume true; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,389 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24807#(<= ~counter~0 1)} {24807#(<= ~counter~0 1)} #71#return; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {24807#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {24807#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24807#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:02,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {24807#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {24835#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,391 INFO L272 TraceCheckUtils]: 23: Hoare triple {24835#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {24835#(<= ~counter~0 2)} ~cond := #in~cond; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {24835#(<= ~counter~0 2)} assume !(0 == ~cond); {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {24835#(<= ~counter~0 2)} assume true; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,393 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24835#(<= ~counter~0 2)} {24835#(<= ~counter~0 2)} #71#return; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {24835#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {24835#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24835#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:02,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {24835#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {24863#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,395 INFO L272 TraceCheckUtils]: 32: Hoare triple {24863#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {24863#(<= ~counter~0 3)} ~cond := #in~cond; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {24863#(<= ~counter~0 3)} assume !(0 == ~cond); {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {24863#(<= ~counter~0 3)} assume true; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,397 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24863#(<= ~counter~0 3)} {24863#(<= ~counter~0 3)} #71#return; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {24863#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {24863#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24863#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:02,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {24863#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {24891#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,400 INFO L272 TraceCheckUtils]: 41: Hoare triple {24891#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {24891#(<= ~counter~0 4)} ~cond := #in~cond; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {24891#(<= ~counter~0 4)} assume !(0 == ~cond); {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {24891#(<= ~counter~0 4)} assume true; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,401 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24891#(<= ~counter~0 4)} {24891#(<= ~counter~0 4)} #71#return; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {24891#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {24891#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24891#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:02,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {24891#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {24919#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,404 INFO L272 TraceCheckUtils]: 50: Hoare triple {24919#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {24919#(<= ~counter~0 5)} ~cond := #in~cond; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {24919#(<= ~counter~0 5)} assume !(0 == ~cond); {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {24919#(<= ~counter~0 5)} assume true; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,405 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {24919#(<= ~counter~0 5)} {24919#(<= ~counter~0 5)} #71#return; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {24919#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {24919#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24919#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:02,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {24919#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {24947#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,407 INFO L272 TraceCheckUtils]: 59: Hoare triple {24947#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {24947#(<= ~counter~0 6)} ~cond := #in~cond; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {24947#(<= ~counter~0 6)} assume !(0 == ~cond); {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {24947#(<= ~counter~0 6)} assume true; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,409 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24947#(<= ~counter~0 6)} {24947#(<= ~counter~0 6)} #71#return; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {24947#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {24947#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24947#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:02,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {24947#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {24975#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,411 INFO L272 TraceCheckUtils]: 68: Hoare triple {24975#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {24975#(<= ~counter~0 7)} ~cond := #in~cond; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,412 INFO L290 TraceCheckUtils]: 70: Hoare triple {24975#(<= ~counter~0 7)} assume !(0 == ~cond); {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {24975#(<= ~counter~0 7)} assume true; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,413 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24975#(<= ~counter~0 7)} {24975#(<= ~counter~0 7)} #71#return; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {24975#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {24975#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24975#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:02,414 INFO L290 TraceCheckUtils]: 75: Hoare triple {24975#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {25003#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,415 INFO L272 TraceCheckUtils]: 77: Hoare triple {25003#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {25003#(<= ~counter~0 8)} ~cond := #in~cond; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {25003#(<= ~counter~0 8)} assume !(0 == ~cond); {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {25003#(<= ~counter~0 8)} assume true; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,417 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25003#(<= ~counter~0 8)} {25003#(<= ~counter~0 8)} #71#return; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {25003#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {25003#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25003#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:02,418 INFO L290 TraceCheckUtils]: 84: Hoare triple {25003#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,418 INFO L290 TraceCheckUtils]: 85: Hoare triple {25031#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,419 INFO L272 TraceCheckUtils]: 86: Hoare triple {25031#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,419 INFO L290 TraceCheckUtils]: 87: Hoare triple {25031#(<= ~counter~0 9)} ~cond := #in~cond; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {25031#(<= ~counter~0 9)} assume !(0 == ~cond); {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,419 INFO L290 TraceCheckUtils]: 89: Hoare triple {25031#(<= ~counter~0 9)} assume true; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,420 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {25031#(<= ~counter~0 9)} {25031#(<= ~counter~0 9)} #71#return; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,420 INFO L290 TraceCheckUtils]: 91: Hoare triple {25031#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,421 INFO L290 TraceCheckUtils]: 92: Hoare triple {25031#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25031#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:02,421 INFO L290 TraceCheckUtils]: 93: Hoare triple {25031#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,421 INFO L290 TraceCheckUtils]: 94: Hoare triple {25059#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,422 INFO L272 TraceCheckUtils]: 95: Hoare triple {25059#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,422 INFO L290 TraceCheckUtils]: 96: Hoare triple {25059#(<= ~counter~0 10)} ~cond := #in~cond; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,422 INFO L290 TraceCheckUtils]: 97: Hoare triple {25059#(<= ~counter~0 10)} assume !(0 == ~cond); {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,423 INFO L290 TraceCheckUtils]: 98: Hoare triple {25059#(<= ~counter~0 10)} assume true; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,423 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25059#(<= ~counter~0 10)} {25059#(<= ~counter~0 10)} #71#return; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,423 INFO L290 TraceCheckUtils]: 100: Hoare triple {25059#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,424 INFO L290 TraceCheckUtils]: 101: Hoare triple {25059#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25059#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:02,424 INFO L290 TraceCheckUtils]: 102: Hoare triple {25059#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,424 INFO L290 TraceCheckUtils]: 103: Hoare triple {25087#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,425 INFO L272 TraceCheckUtils]: 104: Hoare triple {25087#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,425 INFO L290 TraceCheckUtils]: 105: Hoare triple {25087#(<= ~counter~0 11)} ~cond := #in~cond; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,426 INFO L290 TraceCheckUtils]: 106: Hoare triple {25087#(<= ~counter~0 11)} assume !(0 == ~cond); {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,426 INFO L290 TraceCheckUtils]: 107: Hoare triple {25087#(<= ~counter~0 11)} assume true; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,426 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25087#(<= ~counter~0 11)} {25087#(<= ~counter~0 11)} #71#return; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,427 INFO L290 TraceCheckUtils]: 109: Hoare triple {25087#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,427 INFO L290 TraceCheckUtils]: 110: Hoare triple {25087#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25087#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:02,427 INFO L290 TraceCheckUtils]: 111: Hoare triple {25087#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,428 INFO L290 TraceCheckUtils]: 112: Hoare triple {25115#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,428 INFO L272 TraceCheckUtils]: 113: Hoare triple {25115#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,428 INFO L290 TraceCheckUtils]: 114: Hoare triple {25115#(<= ~counter~0 12)} ~cond := #in~cond; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,429 INFO L290 TraceCheckUtils]: 115: Hoare triple {25115#(<= ~counter~0 12)} assume !(0 == ~cond); {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,429 INFO L290 TraceCheckUtils]: 116: Hoare triple {25115#(<= ~counter~0 12)} assume true; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,430 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {25115#(<= ~counter~0 12)} {25115#(<= ~counter~0 12)} #71#return; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,430 INFO L290 TraceCheckUtils]: 118: Hoare triple {25115#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,430 INFO L290 TraceCheckUtils]: 119: Hoare triple {25115#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25115#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:02,431 INFO L290 TraceCheckUtils]: 120: Hoare triple {25115#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,431 INFO L290 TraceCheckUtils]: 121: Hoare triple {25143#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,431 INFO L272 TraceCheckUtils]: 122: Hoare triple {25143#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,432 INFO L290 TraceCheckUtils]: 123: Hoare triple {25143#(<= ~counter~0 13)} ~cond := #in~cond; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,432 INFO L290 TraceCheckUtils]: 124: Hoare triple {25143#(<= ~counter~0 13)} assume !(0 == ~cond); {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,432 INFO L290 TraceCheckUtils]: 125: Hoare triple {25143#(<= ~counter~0 13)} assume true; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,433 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {25143#(<= ~counter~0 13)} {25143#(<= ~counter~0 13)} #71#return; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,433 INFO L290 TraceCheckUtils]: 127: Hoare triple {25143#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,433 INFO L290 TraceCheckUtils]: 128: Hoare triple {25143#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25143#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:02,434 INFO L290 TraceCheckUtils]: 129: Hoare triple {25143#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,434 INFO L290 TraceCheckUtils]: 130: Hoare triple {25171#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,435 INFO L272 TraceCheckUtils]: 131: Hoare triple {25171#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,435 INFO L290 TraceCheckUtils]: 132: Hoare triple {25171#(<= ~counter~0 14)} ~cond := #in~cond; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,435 INFO L290 TraceCheckUtils]: 133: Hoare triple {25171#(<= ~counter~0 14)} assume !(0 == ~cond); {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,435 INFO L290 TraceCheckUtils]: 134: Hoare triple {25171#(<= ~counter~0 14)} assume true; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,436 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25171#(<= ~counter~0 14)} {25171#(<= ~counter~0 14)} #71#return; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,436 INFO L290 TraceCheckUtils]: 136: Hoare triple {25171#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,436 INFO L290 TraceCheckUtils]: 137: Hoare triple {25171#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25171#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:02,437 INFO L290 TraceCheckUtils]: 138: Hoare triple {25171#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25199#(<= |main_#t~post6| 14)} is VALID [2022-04-28 14:11:02,437 INFO L290 TraceCheckUtils]: 139: Hoare triple {25199#(<= |main_#t~post6| 14)} assume !(#t~post6 < 50);havoc #t~post6; {24766#false} is VALID [2022-04-28 14:11:02,437 INFO L272 TraceCheckUtils]: 140: Hoare triple {24766#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {24766#false} is VALID [2022-04-28 14:11:02,437 INFO L290 TraceCheckUtils]: 141: Hoare triple {24766#false} ~cond := #in~cond; {24766#false} is VALID [2022-04-28 14:11:02,437 INFO L290 TraceCheckUtils]: 142: Hoare triple {24766#false} assume 0 == ~cond; {24766#false} is VALID [2022-04-28 14:11:02,437 INFO L290 TraceCheckUtils]: 143: Hoare triple {24766#false} assume !false; {24766#false} is VALID [2022-04-28 14:11:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 28 proven. 847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:11:02,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:03,275 INFO L290 TraceCheckUtils]: 143: Hoare triple {24766#false} assume !false; {24766#false} is VALID [2022-04-28 14:11:03,275 INFO L290 TraceCheckUtils]: 142: Hoare triple {24766#false} assume 0 == ~cond; {24766#false} is VALID [2022-04-28 14:11:03,275 INFO L290 TraceCheckUtils]: 141: Hoare triple {24766#false} ~cond := #in~cond; {24766#false} is VALID [2022-04-28 14:11:03,275 INFO L272 TraceCheckUtils]: 140: Hoare triple {24766#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {24766#false} is VALID [2022-04-28 14:11:03,276 INFO L290 TraceCheckUtils]: 139: Hoare triple {25227#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {24766#false} is VALID [2022-04-28 14:11:03,276 INFO L290 TraceCheckUtils]: 138: Hoare triple {25231#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25227#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:11:03,276 INFO L290 TraceCheckUtils]: 137: Hoare triple {25231#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25231#(< ~counter~0 50)} is VALID [2022-04-28 14:11:03,276 INFO L290 TraceCheckUtils]: 136: Hoare triple {25231#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {25231#(< ~counter~0 50)} is VALID [2022-04-28 14:11:03,277 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {24765#true} {25231#(< ~counter~0 50)} #71#return; {25231#(< ~counter~0 50)} is VALID [2022-04-28 14:11:03,277 INFO L290 TraceCheckUtils]: 134: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,277 INFO L290 TraceCheckUtils]: 133: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,277 INFO L290 TraceCheckUtils]: 132: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,277 INFO L272 TraceCheckUtils]: 131: Hoare triple {25231#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,278 INFO L290 TraceCheckUtils]: 130: Hoare triple {25231#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {25231#(< ~counter~0 50)} is VALID [2022-04-28 14:11:03,278 INFO L290 TraceCheckUtils]: 129: Hoare triple {25259#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25231#(< ~counter~0 50)} is VALID [2022-04-28 14:11:03,279 INFO L290 TraceCheckUtils]: 128: Hoare triple {25259#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25259#(< ~counter~0 49)} is VALID [2022-04-28 14:11:03,279 INFO L290 TraceCheckUtils]: 127: Hoare triple {25259#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {25259#(< ~counter~0 49)} is VALID [2022-04-28 14:11:03,279 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {24765#true} {25259#(< ~counter~0 49)} #71#return; {25259#(< ~counter~0 49)} is VALID [2022-04-28 14:11:03,279 INFO L290 TraceCheckUtils]: 125: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,280 INFO L290 TraceCheckUtils]: 124: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,280 INFO L290 TraceCheckUtils]: 123: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,280 INFO L272 TraceCheckUtils]: 122: Hoare triple {25259#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,280 INFO L290 TraceCheckUtils]: 121: Hoare triple {25259#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {25259#(< ~counter~0 49)} is VALID [2022-04-28 14:11:03,280 INFO L290 TraceCheckUtils]: 120: Hoare triple {25287#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25259#(< ~counter~0 49)} is VALID [2022-04-28 14:11:03,281 INFO L290 TraceCheckUtils]: 119: Hoare triple {25287#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25287#(< ~counter~0 48)} is VALID [2022-04-28 14:11:03,281 INFO L290 TraceCheckUtils]: 118: Hoare triple {25287#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {25287#(< ~counter~0 48)} is VALID [2022-04-28 14:11:03,281 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {24765#true} {25287#(< ~counter~0 48)} #71#return; {25287#(< ~counter~0 48)} is VALID [2022-04-28 14:11:03,282 INFO L290 TraceCheckUtils]: 116: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,282 INFO L290 TraceCheckUtils]: 115: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,282 INFO L290 TraceCheckUtils]: 114: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,282 INFO L272 TraceCheckUtils]: 113: Hoare triple {25287#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,282 INFO L290 TraceCheckUtils]: 112: Hoare triple {25287#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {25287#(< ~counter~0 48)} is VALID [2022-04-28 14:11:03,282 INFO L290 TraceCheckUtils]: 111: Hoare triple {25315#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25287#(< ~counter~0 48)} is VALID [2022-04-28 14:11:03,283 INFO L290 TraceCheckUtils]: 110: Hoare triple {25315#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25315#(< ~counter~0 47)} is VALID [2022-04-28 14:11:03,283 INFO L290 TraceCheckUtils]: 109: Hoare triple {25315#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {25315#(< ~counter~0 47)} is VALID [2022-04-28 14:11:03,284 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24765#true} {25315#(< ~counter~0 47)} #71#return; {25315#(< ~counter~0 47)} is VALID [2022-04-28 14:11:03,284 INFO L290 TraceCheckUtils]: 107: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,284 INFO L290 TraceCheckUtils]: 106: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,284 INFO L290 TraceCheckUtils]: 105: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,284 INFO L272 TraceCheckUtils]: 104: Hoare triple {25315#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,284 INFO L290 TraceCheckUtils]: 103: Hoare triple {25315#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {25315#(< ~counter~0 47)} is VALID [2022-04-28 14:11:03,285 INFO L290 TraceCheckUtils]: 102: Hoare triple {25343#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25315#(< ~counter~0 47)} is VALID [2022-04-28 14:11:03,285 INFO L290 TraceCheckUtils]: 101: Hoare triple {25343#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25343#(< ~counter~0 46)} is VALID [2022-04-28 14:11:03,285 INFO L290 TraceCheckUtils]: 100: Hoare triple {25343#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {25343#(< ~counter~0 46)} is VALID [2022-04-28 14:11:03,286 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {24765#true} {25343#(< ~counter~0 46)} #71#return; {25343#(< ~counter~0 46)} is VALID [2022-04-28 14:11:03,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,286 INFO L290 TraceCheckUtils]: 96: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,286 INFO L272 TraceCheckUtils]: 95: Hoare triple {25343#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,286 INFO L290 TraceCheckUtils]: 94: Hoare triple {25343#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {25343#(< ~counter~0 46)} is VALID [2022-04-28 14:11:03,287 INFO L290 TraceCheckUtils]: 93: Hoare triple {25371#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25343#(< ~counter~0 46)} is VALID [2022-04-28 14:11:03,287 INFO L290 TraceCheckUtils]: 92: Hoare triple {25371#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25371#(< ~counter~0 45)} is VALID [2022-04-28 14:11:03,287 INFO L290 TraceCheckUtils]: 91: Hoare triple {25371#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {25371#(< ~counter~0 45)} is VALID [2022-04-28 14:11:03,288 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24765#true} {25371#(< ~counter~0 45)} #71#return; {25371#(< ~counter~0 45)} is VALID [2022-04-28 14:11:03,288 INFO L290 TraceCheckUtils]: 89: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,288 INFO L290 TraceCheckUtils]: 88: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,288 INFO L290 TraceCheckUtils]: 87: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,288 INFO L272 TraceCheckUtils]: 86: Hoare triple {25371#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {25371#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {25371#(< ~counter~0 45)} is VALID [2022-04-28 14:11:03,289 INFO L290 TraceCheckUtils]: 84: Hoare triple {25399#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25371#(< ~counter~0 45)} is VALID [2022-04-28 14:11:03,289 INFO L290 TraceCheckUtils]: 83: Hoare triple {25399#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25399#(< ~counter~0 44)} is VALID [2022-04-28 14:11:03,289 INFO L290 TraceCheckUtils]: 82: Hoare triple {25399#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {25399#(< ~counter~0 44)} is VALID [2022-04-28 14:11:03,290 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24765#true} {25399#(< ~counter~0 44)} #71#return; {25399#(< ~counter~0 44)} is VALID [2022-04-28 14:11:03,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,290 INFO L272 TraceCheckUtils]: 77: Hoare triple {25399#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {25399#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {25399#(< ~counter~0 44)} is VALID [2022-04-28 14:11:03,291 INFO L290 TraceCheckUtils]: 75: Hoare triple {25427#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25399#(< ~counter~0 44)} is VALID [2022-04-28 14:11:03,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {25427#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25427#(< ~counter~0 43)} is VALID [2022-04-28 14:11:03,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {25427#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {25427#(< ~counter~0 43)} is VALID [2022-04-28 14:11:03,292 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24765#true} {25427#(< ~counter~0 43)} #71#return; {25427#(< ~counter~0 43)} is VALID [2022-04-28 14:11:03,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,292 INFO L290 TraceCheckUtils]: 69: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,292 INFO L272 TraceCheckUtils]: 68: Hoare triple {25427#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {25427#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {25427#(< ~counter~0 43)} is VALID [2022-04-28 14:11:03,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {25455#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25427#(< ~counter~0 43)} is VALID [2022-04-28 14:11:03,293 INFO L290 TraceCheckUtils]: 65: Hoare triple {25455#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25455#(< ~counter~0 42)} is VALID [2022-04-28 14:11:03,294 INFO L290 TraceCheckUtils]: 64: Hoare triple {25455#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {25455#(< ~counter~0 42)} is VALID [2022-04-28 14:11:03,294 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24765#true} {25455#(< ~counter~0 42)} #71#return; {25455#(< ~counter~0 42)} is VALID [2022-04-28 14:11:03,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,294 INFO L272 TraceCheckUtils]: 59: Hoare triple {25455#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {25455#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {25455#(< ~counter~0 42)} is VALID [2022-04-28 14:11:03,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {25483#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25455#(< ~counter~0 42)} is VALID [2022-04-28 14:11:03,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {25483#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25483#(< ~counter~0 41)} is VALID [2022-04-28 14:11:03,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {25483#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {25483#(< ~counter~0 41)} is VALID [2022-04-28 14:11:03,296 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {24765#true} {25483#(< ~counter~0 41)} #71#return; {25483#(< ~counter~0 41)} is VALID [2022-04-28 14:11:03,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,297 INFO L272 TraceCheckUtils]: 50: Hoare triple {25483#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {25483#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {25483#(< ~counter~0 41)} is VALID [2022-04-28 14:11:03,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {25511#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25483#(< ~counter~0 41)} is VALID [2022-04-28 14:11:03,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {25511#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25511#(< ~counter~0 40)} is VALID [2022-04-28 14:11:03,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {25511#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {25511#(< ~counter~0 40)} is VALID [2022-04-28 14:11:03,298 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24765#true} {25511#(< ~counter~0 40)} #71#return; {25511#(< ~counter~0 40)} is VALID [2022-04-28 14:11:03,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,299 INFO L272 TraceCheckUtils]: 41: Hoare triple {25511#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {25511#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {25511#(< ~counter~0 40)} is VALID [2022-04-28 14:11:03,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {25539#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25511#(< ~counter~0 40)} is VALID [2022-04-28 14:11:03,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {25539#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25539#(< ~counter~0 39)} is VALID [2022-04-28 14:11:03,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {25539#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {25539#(< ~counter~0 39)} is VALID [2022-04-28 14:11:03,300 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24765#true} {25539#(< ~counter~0 39)} #71#return; {25539#(< ~counter~0 39)} is VALID [2022-04-28 14:11:03,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,301 INFO L272 TraceCheckUtils]: 32: Hoare triple {25539#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {25539#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {25539#(< ~counter~0 39)} is VALID [2022-04-28 14:11:03,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {25567#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25539#(< ~counter~0 39)} is VALID [2022-04-28 14:11:03,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {25567#(< ~counter~0 38)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25567#(< ~counter~0 38)} is VALID [2022-04-28 14:11:03,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {25567#(< ~counter~0 38)} assume !!(0 != ~a~0 && 0 != ~b~0); {25567#(< ~counter~0 38)} is VALID [2022-04-28 14:11:03,303 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24765#true} {25567#(< ~counter~0 38)} #71#return; {25567#(< ~counter~0 38)} is VALID [2022-04-28 14:11:03,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,303 INFO L272 TraceCheckUtils]: 23: Hoare triple {25567#(< ~counter~0 38)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {25567#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {25567#(< ~counter~0 38)} is VALID [2022-04-28 14:11:03,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {25595#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25567#(< ~counter~0 38)} is VALID [2022-04-28 14:11:03,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {25595#(< ~counter~0 37)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25595#(< ~counter~0 37)} is VALID [2022-04-28 14:11:03,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {25595#(< ~counter~0 37)} assume !!(0 != ~a~0 && 0 != ~b~0); {25595#(< ~counter~0 37)} is VALID [2022-04-28 14:11:03,305 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24765#true} {25595#(< ~counter~0 37)} #71#return; {25595#(< ~counter~0 37)} is VALID [2022-04-28 14:11:03,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,305 INFO L272 TraceCheckUtils]: 14: Hoare triple {25595#(< ~counter~0 37)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {25595#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {25595#(< ~counter~0 37)} is VALID [2022-04-28 14:11:03,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {25623#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25595#(< ~counter~0 37)} is VALID [2022-04-28 14:11:03,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {25623#(< ~counter~0 36)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24765#true} {25623#(< ~counter~0 36)} #69#return; {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {24765#true} assume true; {24765#true} is VALID [2022-04-28 14:11:03,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {24765#true} assume !(0 == ~cond); {24765#true} is VALID [2022-04-28 14:11:03,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {24765#true} ~cond := #in~cond; {24765#true} is VALID [2022-04-28 14:11:03,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {25623#(< ~counter~0 36)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24765#true} is VALID [2022-04-28 14:11:03,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {25623#(< ~counter~0 36)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {25623#(< ~counter~0 36)} call #t~ret7 := main(); {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25623#(< ~counter~0 36)} {24765#true} #77#return; {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {25623#(< ~counter~0 36)} assume true; {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {24765#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25623#(< ~counter~0 36)} is VALID [2022-04-28 14:11:03,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {24765#true} call ULTIMATE.init(); {24765#true} is VALID [2022-04-28 14:11:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 28 proven. 483 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-28 14:11:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602461564] [2022-04-28 14:11:03,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:03,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240274004] [2022-04-28 14:11:03,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240274004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:11:03,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:11:03,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 14:11:03,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:03,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595084358] [2022-04-28 14:11:03,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595084358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:03,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:03,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 14:11:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991718725] [2022-04-28 14:11:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 144 [2022-04-28 14:11:03,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:03,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:11:03,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:03,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 14:11:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 14:11:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 14:11:03,426 INFO L87 Difference]: Start difference. First operand 186 states and 230 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:11:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:04,330 INFO L93 Difference]: Finished difference Result 205 states and 253 transitions. [2022-04-28 14:11:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 14:11:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 144 [2022-04-28 14:11:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:11:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 239 transitions. [2022-04-28 14:11:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:11:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 239 transitions. [2022-04-28 14:11:04,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 239 transitions. [2022-04-28 14:11:04,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:04,579 INFO L225 Difference]: With dead ends: 205 [2022-04-28 14:11:04,579 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 14:11:04,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=963, Invalid=1293, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 14:11:04,581 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:11:04,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 262 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:11:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 14:11:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-04-28 14:11:05,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:05,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:05,037 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:05,038 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:05,041 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2022-04-28 14:11:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-28 14:11:05,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:05,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:05,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 197 states. [2022-04-28 14:11:05,042 INFO L87 Difference]: Start difference. First operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 197 states. [2022-04-28 14:11:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:05,045 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2022-04-28 14:11:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-28 14:11:05,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:05,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:05,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:05,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:11:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2022-04-28 14:11:05,050 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 144 [2022-04-28 14:11:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:05,050 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2022-04-28 14:11:05,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 14:11:05,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 244 transitions. [2022-04-28 14:11:35,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 230 inductive. 0 not inductive. 14 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-28 14:11:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-28 14:11:35,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:11:35,359 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:11:35,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 14:11:35,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 14:11:35,567 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:11:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:11:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494722, now seen corresponding path program 29 times [2022-04-28 14:11:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:35,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809268228] [2022-04-28 14:11:41,618 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:11:41,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:11:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494722, now seen corresponding path program 30 times [2022-04-28 14:11:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:41,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732615731] [2022-04-28 14:11:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:41,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:41,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085973113] [2022-04-28 14:11:41,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:11:41,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:41,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:41,641 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:11:41,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 14:11:41,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 14:11:41,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:41,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 14:11:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:41,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:42,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {26888#true} call ULTIMATE.init(); {26888#true} is VALID [2022-04-28 14:11:42,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {26888#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {26896#(<= ~counter~0 0)} assume true; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26896#(<= ~counter~0 0)} {26888#true} #77#return; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {26896#(<= ~counter~0 0)} call #t~ret7 := main(); {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {26896#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {26896#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {26896#(<= ~counter~0 0)} ~cond := #in~cond; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {26896#(<= ~counter~0 0)} assume !(0 == ~cond); {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {26896#(<= ~counter~0 0)} assume true; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26896#(<= ~counter~0 0)} {26896#(<= ~counter~0 0)} #69#return; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {26896#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {26896#(<= ~counter~0 0)} is VALID [2022-04-28 14:11:42,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {26896#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {26930#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,746 INFO L272 TraceCheckUtils]: 14: Hoare triple {26930#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {26930#(<= ~counter~0 1)} ~cond := #in~cond; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {26930#(<= ~counter~0 1)} assume !(0 == ~cond); {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {26930#(<= ~counter~0 1)} assume true; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,747 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26930#(<= ~counter~0 1)} {26930#(<= ~counter~0 1)} #71#return; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {26930#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {26930#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26930#(<= ~counter~0 1)} is VALID [2022-04-28 14:11:42,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {26930#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {26958#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,749 INFO L272 TraceCheckUtils]: 23: Hoare triple {26958#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {26958#(<= ~counter~0 2)} ~cond := #in~cond; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {26958#(<= ~counter~0 2)} assume !(0 == ~cond); {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {26958#(<= ~counter~0 2)} assume true; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,751 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26958#(<= ~counter~0 2)} {26958#(<= ~counter~0 2)} #71#return; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {26958#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {26958#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26958#(<= ~counter~0 2)} is VALID [2022-04-28 14:11:42,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {26958#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {26986#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,753 INFO L272 TraceCheckUtils]: 32: Hoare triple {26986#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {26986#(<= ~counter~0 3)} ~cond := #in~cond; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {26986#(<= ~counter~0 3)} assume !(0 == ~cond); {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {26986#(<= ~counter~0 3)} assume true; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,754 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26986#(<= ~counter~0 3)} {26986#(<= ~counter~0 3)} #71#return; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {26986#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {26986#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26986#(<= ~counter~0 3)} is VALID [2022-04-28 14:11:42,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {26986#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {27014#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,760 INFO L272 TraceCheckUtils]: 41: Hoare triple {27014#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {27014#(<= ~counter~0 4)} ~cond := #in~cond; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {27014#(<= ~counter~0 4)} assume !(0 == ~cond); {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {27014#(<= ~counter~0 4)} assume true; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,762 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27014#(<= ~counter~0 4)} {27014#(<= ~counter~0 4)} #71#return; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {27014#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {27014#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27014#(<= ~counter~0 4)} is VALID [2022-04-28 14:11:42,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {27014#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {27042#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,764 INFO L272 TraceCheckUtils]: 50: Hoare triple {27042#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {27042#(<= ~counter~0 5)} ~cond := #in~cond; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {27042#(<= ~counter~0 5)} assume !(0 == ~cond); {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {27042#(<= ~counter~0 5)} assume true; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,766 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27042#(<= ~counter~0 5)} {27042#(<= ~counter~0 5)} #71#return; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {27042#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {27042#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27042#(<= ~counter~0 5)} is VALID [2022-04-28 14:11:42,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {27042#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {27070#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,768 INFO L272 TraceCheckUtils]: 59: Hoare triple {27070#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {27070#(<= ~counter~0 6)} ~cond := #in~cond; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {27070#(<= ~counter~0 6)} assume !(0 == ~cond); {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {27070#(<= ~counter~0 6)} assume true; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,770 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {27070#(<= ~counter~0 6)} {27070#(<= ~counter~0 6)} #71#return; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {27070#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {27070#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27070#(<= ~counter~0 6)} is VALID [2022-04-28 14:11:42,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {27070#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {27098#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,773 INFO L272 TraceCheckUtils]: 68: Hoare triple {27098#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {27098#(<= ~counter~0 7)} ~cond := #in~cond; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {27098#(<= ~counter~0 7)} assume !(0 == ~cond); {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {27098#(<= ~counter~0 7)} assume true; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,775 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {27098#(<= ~counter~0 7)} {27098#(<= ~counter~0 7)} #71#return; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {27098#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {27098#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27098#(<= ~counter~0 7)} is VALID [2022-04-28 14:11:42,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {27098#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {27126#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,777 INFO L272 TraceCheckUtils]: 77: Hoare triple {27126#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {27126#(<= ~counter~0 8)} ~cond := #in~cond; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {27126#(<= ~counter~0 8)} assume !(0 == ~cond); {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {27126#(<= ~counter~0 8)} assume true; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,779 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27126#(<= ~counter~0 8)} {27126#(<= ~counter~0 8)} #71#return; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {27126#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {27126#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27126#(<= ~counter~0 8)} is VALID [2022-04-28 14:11:42,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {27126#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {27154#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,781 INFO L272 TraceCheckUtils]: 86: Hoare triple {27154#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,781 INFO L290 TraceCheckUtils]: 87: Hoare triple {27154#(<= ~counter~0 9)} ~cond := #in~cond; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,782 INFO L290 TraceCheckUtils]: 88: Hoare triple {27154#(<= ~counter~0 9)} assume !(0 == ~cond); {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {27154#(<= ~counter~0 9)} assume true; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,783 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27154#(<= ~counter~0 9)} {27154#(<= ~counter~0 9)} #71#return; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,783 INFO L290 TraceCheckUtils]: 91: Hoare triple {27154#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,783 INFO L290 TraceCheckUtils]: 92: Hoare triple {27154#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27154#(<= ~counter~0 9)} is VALID [2022-04-28 14:11:42,784 INFO L290 TraceCheckUtils]: 93: Hoare triple {27154#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,784 INFO L290 TraceCheckUtils]: 94: Hoare triple {27182#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,785 INFO L272 TraceCheckUtils]: 95: Hoare triple {27182#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,785 INFO L290 TraceCheckUtils]: 96: Hoare triple {27182#(<= ~counter~0 10)} ~cond := #in~cond; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,785 INFO L290 TraceCheckUtils]: 97: Hoare triple {27182#(<= ~counter~0 10)} assume !(0 == ~cond); {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,786 INFO L290 TraceCheckUtils]: 98: Hoare triple {27182#(<= ~counter~0 10)} assume true; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,786 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27182#(<= ~counter~0 10)} {27182#(<= ~counter~0 10)} #71#return; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,786 INFO L290 TraceCheckUtils]: 100: Hoare triple {27182#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,787 INFO L290 TraceCheckUtils]: 101: Hoare triple {27182#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27182#(<= ~counter~0 10)} is VALID [2022-04-28 14:11:42,787 INFO L290 TraceCheckUtils]: 102: Hoare triple {27182#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,787 INFO L290 TraceCheckUtils]: 103: Hoare triple {27210#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,788 INFO L272 TraceCheckUtils]: 104: Hoare triple {27210#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,788 INFO L290 TraceCheckUtils]: 105: Hoare triple {27210#(<= ~counter~0 11)} ~cond := #in~cond; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,789 INFO L290 TraceCheckUtils]: 106: Hoare triple {27210#(<= ~counter~0 11)} assume !(0 == ~cond); {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,789 INFO L290 TraceCheckUtils]: 107: Hoare triple {27210#(<= ~counter~0 11)} assume true; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,789 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27210#(<= ~counter~0 11)} {27210#(<= ~counter~0 11)} #71#return; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,790 INFO L290 TraceCheckUtils]: 109: Hoare triple {27210#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,790 INFO L290 TraceCheckUtils]: 110: Hoare triple {27210#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27210#(<= ~counter~0 11)} is VALID [2022-04-28 14:11:42,790 INFO L290 TraceCheckUtils]: 111: Hoare triple {27210#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,791 INFO L290 TraceCheckUtils]: 112: Hoare triple {27238#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,791 INFO L272 TraceCheckUtils]: 113: Hoare triple {27238#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,791 INFO L290 TraceCheckUtils]: 114: Hoare triple {27238#(<= ~counter~0 12)} ~cond := #in~cond; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,792 INFO L290 TraceCheckUtils]: 115: Hoare triple {27238#(<= ~counter~0 12)} assume !(0 == ~cond); {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,792 INFO L290 TraceCheckUtils]: 116: Hoare triple {27238#(<= ~counter~0 12)} assume true; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,793 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {27238#(<= ~counter~0 12)} {27238#(<= ~counter~0 12)} #71#return; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,793 INFO L290 TraceCheckUtils]: 118: Hoare triple {27238#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,793 INFO L290 TraceCheckUtils]: 119: Hoare triple {27238#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27238#(<= ~counter~0 12)} is VALID [2022-04-28 14:11:42,794 INFO L290 TraceCheckUtils]: 120: Hoare triple {27238#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,794 INFO L290 TraceCheckUtils]: 121: Hoare triple {27266#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,794 INFO L272 TraceCheckUtils]: 122: Hoare triple {27266#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,795 INFO L290 TraceCheckUtils]: 123: Hoare triple {27266#(<= ~counter~0 13)} ~cond := #in~cond; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,795 INFO L290 TraceCheckUtils]: 124: Hoare triple {27266#(<= ~counter~0 13)} assume !(0 == ~cond); {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,795 INFO L290 TraceCheckUtils]: 125: Hoare triple {27266#(<= ~counter~0 13)} assume true; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,796 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {27266#(<= ~counter~0 13)} {27266#(<= ~counter~0 13)} #71#return; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,796 INFO L290 TraceCheckUtils]: 127: Hoare triple {27266#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,796 INFO L290 TraceCheckUtils]: 128: Hoare triple {27266#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27266#(<= ~counter~0 13)} is VALID [2022-04-28 14:11:42,797 INFO L290 TraceCheckUtils]: 129: Hoare triple {27266#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,797 INFO L290 TraceCheckUtils]: 130: Hoare triple {27294#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,798 INFO L272 TraceCheckUtils]: 131: Hoare triple {27294#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,798 INFO L290 TraceCheckUtils]: 132: Hoare triple {27294#(<= ~counter~0 14)} ~cond := #in~cond; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,798 INFO L290 TraceCheckUtils]: 133: Hoare triple {27294#(<= ~counter~0 14)} assume !(0 == ~cond); {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,799 INFO L290 TraceCheckUtils]: 134: Hoare triple {27294#(<= ~counter~0 14)} assume true; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,800 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {27294#(<= ~counter~0 14)} {27294#(<= ~counter~0 14)} #71#return; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,800 INFO L290 TraceCheckUtils]: 136: Hoare triple {27294#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,800 INFO L290 TraceCheckUtils]: 137: Hoare triple {27294#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27294#(<= ~counter~0 14)} is VALID [2022-04-28 14:11:42,801 INFO L290 TraceCheckUtils]: 138: Hoare triple {27294#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,801 INFO L290 TraceCheckUtils]: 139: Hoare triple {27322#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,802 INFO L272 TraceCheckUtils]: 140: Hoare triple {27322#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,802 INFO L290 TraceCheckUtils]: 141: Hoare triple {27322#(<= ~counter~0 15)} ~cond := #in~cond; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,802 INFO L290 TraceCheckUtils]: 142: Hoare triple {27322#(<= ~counter~0 15)} assume !(0 == ~cond); {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,802 INFO L290 TraceCheckUtils]: 143: Hoare triple {27322#(<= ~counter~0 15)} assume true; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,803 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {27322#(<= ~counter~0 15)} {27322#(<= ~counter~0 15)} #71#return; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,803 INFO L290 TraceCheckUtils]: 145: Hoare triple {27322#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,804 INFO L290 TraceCheckUtils]: 146: Hoare triple {27322#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27322#(<= ~counter~0 15)} is VALID [2022-04-28 14:11:42,804 INFO L290 TraceCheckUtils]: 147: Hoare triple {27322#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27350#(<= |main_#t~post6| 15)} is VALID [2022-04-28 14:11:42,804 INFO L290 TraceCheckUtils]: 148: Hoare triple {27350#(<= |main_#t~post6| 15)} assume !(#t~post6 < 50);havoc #t~post6; {26889#false} is VALID [2022-04-28 14:11:42,804 INFO L272 TraceCheckUtils]: 149: Hoare triple {26889#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {26889#false} is VALID [2022-04-28 14:11:42,804 INFO L290 TraceCheckUtils]: 150: Hoare triple {26889#false} ~cond := #in~cond; {26889#false} is VALID [2022-04-28 14:11:42,804 INFO L290 TraceCheckUtils]: 151: Hoare triple {26889#false} assume 0 == ~cond; {26889#false} is VALID [2022-04-28 14:11:42,805 INFO L290 TraceCheckUtils]: 152: Hoare triple {26889#false} assume !false; {26889#false} is VALID [2022-04-28 14:11:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 30 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:11:42,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:43,703 INFO L290 TraceCheckUtils]: 152: Hoare triple {26889#false} assume !false; {26889#false} is VALID [2022-04-28 14:11:43,703 INFO L290 TraceCheckUtils]: 151: Hoare triple {26889#false} assume 0 == ~cond; {26889#false} is VALID [2022-04-28 14:11:43,704 INFO L290 TraceCheckUtils]: 150: Hoare triple {26889#false} ~cond := #in~cond; {26889#false} is VALID [2022-04-28 14:11:43,704 INFO L272 TraceCheckUtils]: 149: Hoare triple {26889#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {26889#false} is VALID [2022-04-28 14:11:43,704 INFO L290 TraceCheckUtils]: 148: Hoare triple {27378#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {26889#false} is VALID [2022-04-28 14:11:43,704 INFO L290 TraceCheckUtils]: 147: Hoare triple {27382#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27378#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:11:43,705 INFO L290 TraceCheckUtils]: 146: Hoare triple {27382#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27382#(< ~counter~0 50)} is VALID [2022-04-28 14:11:43,705 INFO L290 TraceCheckUtils]: 145: Hoare triple {27382#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {27382#(< ~counter~0 50)} is VALID [2022-04-28 14:11:43,705 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {26888#true} {27382#(< ~counter~0 50)} #71#return; {27382#(< ~counter~0 50)} is VALID [2022-04-28 14:11:43,706 INFO L290 TraceCheckUtils]: 143: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,706 INFO L290 TraceCheckUtils]: 142: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,706 INFO L290 TraceCheckUtils]: 141: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,706 INFO L272 TraceCheckUtils]: 140: Hoare triple {27382#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,706 INFO L290 TraceCheckUtils]: 139: Hoare triple {27382#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {27382#(< ~counter~0 50)} is VALID [2022-04-28 14:11:43,707 INFO L290 TraceCheckUtils]: 138: Hoare triple {27410#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27382#(< ~counter~0 50)} is VALID [2022-04-28 14:11:43,707 INFO L290 TraceCheckUtils]: 137: Hoare triple {27410#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27410#(< ~counter~0 49)} is VALID [2022-04-28 14:11:43,707 INFO L290 TraceCheckUtils]: 136: Hoare triple {27410#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {27410#(< ~counter~0 49)} is VALID [2022-04-28 14:11:43,708 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {26888#true} {27410#(< ~counter~0 49)} #71#return; {27410#(< ~counter~0 49)} is VALID [2022-04-28 14:11:43,708 INFO L290 TraceCheckUtils]: 134: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,708 INFO L290 TraceCheckUtils]: 133: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,708 INFO L290 TraceCheckUtils]: 132: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,708 INFO L272 TraceCheckUtils]: 131: Hoare triple {27410#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,708 INFO L290 TraceCheckUtils]: 130: Hoare triple {27410#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {27410#(< ~counter~0 49)} is VALID [2022-04-28 14:11:43,709 INFO L290 TraceCheckUtils]: 129: Hoare triple {27438#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27410#(< ~counter~0 49)} is VALID [2022-04-28 14:11:43,709 INFO L290 TraceCheckUtils]: 128: Hoare triple {27438#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27438#(< ~counter~0 48)} is VALID [2022-04-28 14:11:43,709 INFO L290 TraceCheckUtils]: 127: Hoare triple {27438#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {27438#(< ~counter~0 48)} is VALID [2022-04-28 14:11:43,710 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {26888#true} {27438#(< ~counter~0 48)} #71#return; {27438#(< ~counter~0 48)} is VALID [2022-04-28 14:11:43,710 INFO L290 TraceCheckUtils]: 125: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,710 INFO L290 TraceCheckUtils]: 124: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,710 INFO L290 TraceCheckUtils]: 123: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,710 INFO L272 TraceCheckUtils]: 122: Hoare triple {27438#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,710 INFO L290 TraceCheckUtils]: 121: Hoare triple {27438#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {27438#(< ~counter~0 48)} is VALID [2022-04-28 14:11:43,711 INFO L290 TraceCheckUtils]: 120: Hoare triple {27466#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27438#(< ~counter~0 48)} is VALID [2022-04-28 14:11:43,711 INFO L290 TraceCheckUtils]: 119: Hoare triple {27466#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27466#(< ~counter~0 47)} is VALID [2022-04-28 14:11:43,711 INFO L290 TraceCheckUtils]: 118: Hoare triple {27466#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {27466#(< ~counter~0 47)} is VALID [2022-04-28 14:11:43,712 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {26888#true} {27466#(< ~counter~0 47)} #71#return; {27466#(< ~counter~0 47)} is VALID [2022-04-28 14:11:43,712 INFO L290 TraceCheckUtils]: 116: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,712 INFO L290 TraceCheckUtils]: 115: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,712 INFO L290 TraceCheckUtils]: 114: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,712 INFO L272 TraceCheckUtils]: 113: Hoare triple {27466#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,713 INFO L290 TraceCheckUtils]: 112: Hoare triple {27466#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {27466#(< ~counter~0 47)} is VALID [2022-04-28 14:11:43,713 INFO L290 TraceCheckUtils]: 111: Hoare triple {27494#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27466#(< ~counter~0 47)} is VALID [2022-04-28 14:11:43,713 INFO L290 TraceCheckUtils]: 110: Hoare triple {27494#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27494#(< ~counter~0 46)} is VALID [2022-04-28 14:11:43,714 INFO L290 TraceCheckUtils]: 109: Hoare triple {27494#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {27494#(< ~counter~0 46)} is VALID [2022-04-28 14:11:43,714 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {26888#true} {27494#(< ~counter~0 46)} #71#return; {27494#(< ~counter~0 46)} is VALID [2022-04-28 14:11:43,714 INFO L290 TraceCheckUtils]: 107: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,714 INFO L290 TraceCheckUtils]: 106: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,714 INFO L290 TraceCheckUtils]: 105: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,714 INFO L272 TraceCheckUtils]: 104: Hoare triple {27494#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,715 INFO L290 TraceCheckUtils]: 103: Hoare triple {27494#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {27494#(< ~counter~0 46)} is VALID [2022-04-28 14:11:43,715 INFO L290 TraceCheckUtils]: 102: Hoare triple {27522#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27494#(< ~counter~0 46)} is VALID [2022-04-28 14:11:43,715 INFO L290 TraceCheckUtils]: 101: Hoare triple {27522#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27522#(< ~counter~0 45)} is VALID [2022-04-28 14:11:43,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {27522#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {27522#(< ~counter~0 45)} is VALID [2022-04-28 14:11:43,716 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {26888#true} {27522#(< ~counter~0 45)} #71#return; {27522#(< ~counter~0 45)} is VALID [2022-04-28 14:11:43,716 INFO L290 TraceCheckUtils]: 98: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,716 INFO L290 TraceCheckUtils]: 97: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,717 INFO L290 TraceCheckUtils]: 96: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,717 INFO L272 TraceCheckUtils]: 95: Hoare triple {27522#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,717 INFO L290 TraceCheckUtils]: 94: Hoare triple {27522#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {27522#(< ~counter~0 45)} is VALID [2022-04-28 14:11:43,717 INFO L290 TraceCheckUtils]: 93: Hoare triple {27550#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27522#(< ~counter~0 45)} is VALID [2022-04-28 14:11:43,718 INFO L290 TraceCheckUtils]: 92: Hoare triple {27550#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27550#(< ~counter~0 44)} is VALID [2022-04-28 14:11:43,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {27550#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {27550#(< ~counter~0 44)} is VALID [2022-04-28 14:11:43,718 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26888#true} {27550#(< ~counter~0 44)} #71#return; {27550#(< ~counter~0 44)} is VALID [2022-04-28 14:11:43,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,719 INFO L290 TraceCheckUtils]: 88: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,719 INFO L290 TraceCheckUtils]: 87: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,719 INFO L272 TraceCheckUtils]: 86: Hoare triple {27550#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {27550#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {27550#(< ~counter~0 44)} is VALID [2022-04-28 14:11:43,719 INFO L290 TraceCheckUtils]: 84: Hoare triple {27578#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27550#(< ~counter~0 44)} is VALID [2022-04-28 14:11:43,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {27578#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27578#(< ~counter~0 43)} is VALID [2022-04-28 14:11:43,723 INFO L290 TraceCheckUtils]: 82: Hoare triple {27578#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {27578#(< ~counter~0 43)} is VALID [2022-04-28 14:11:43,724 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26888#true} {27578#(< ~counter~0 43)} #71#return; {27578#(< ~counter~0 43)} is VALID [2022-04-28 14:11:43,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,725 INFO L290 TraceCheckUtils]: 78: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,725 INFO L272 TraceCheckUtils]: 77: Hoare triple {27578#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {27578#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {27578#(< ~counter~0 43)} is VALID [2022-04-28 14:11:43,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {27606#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27578#(< ~counter~0 43)} is VALID [2022-04-28 14:11:43,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {27606#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27606#(< ~counter~0 42)} is VALID [2022-04-28 14:11:43,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {27606#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {27606#(< ~counter~0 42)} is VALID [2022-04-28 14:11:43,727 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26888#true} {27606#(< ~counter~0 42)} #71#return; {27606#(< ~counter~0 42)} is VALID [2022-04-28 14:11:43,727 INFO L290 TraceCheckUtils]: 71: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,728 INFO L272 TraceCheckUtils]: 68: Hoare triple {27606#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {27606#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {27606#(< ~counter~0 42)} is VALID [2022-04-28 14:11:43,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {27634#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27606#(< ~counter~0 42)} is VALID [2022-04-28 14:11:43,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {27634#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27634#(< ~counter~0 41)} is VALID [2022-04-28 14:11:43,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {27634#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {27634#(< ~counter~0 41)} is VALID [2022-04-28 14:11:43,730 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26888#true} {27634#(< ~counter~0 41)} #71#return; {27634#(< ~counter~0 41)} is VALID [2022-04-28 14:11:43,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,731 INFO L272 TraceCheckUtils]: 59: Hoare triple {27634#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {27634#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {27634#(< ~counter~0 41)} is VALID [2022-04-28 14:11:43,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {27662#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27634#(< ~counter~0 41)} is VALID [2022-04-28 14:11:43,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {27662#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27662#(< ~counter~0 40)} is VALID [2022-04-28 14:11:43,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {27662#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {27662#(< ~counter~0 40)} is VALID [2022-04-28 14:11:43,733 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {26888#true} {27662#(< ~counter~0 40)} #71#return; {27662#(< ~counter~0 40)} is VALID [2022-04-28 14:11:43,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,733 INFO L272 TraceCheckUtils]: 50: Hoare triple {27662#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {27662#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {27662#(< ~counter~0 40)} is VALID [2022-04-28 14:11:43,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {27690#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27662#(< ~counter~0 40)} is VALID [2022-04-28 14:11:43,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {27690#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27690#(< ~counter~0 39)} is VALID [2022-04-28 14:11:43,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {27690#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {27690#(< ~counter~0 39)} is VALID [2022-04-28 14:11:43,736 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26888#true} {27690#(< ~counter~0 39)} #71#return; {27690#(< ~counter~0 39)} is VALID [2022-04-28 14:11:43,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,736 INFO L272 TraceCheckUtils]: 41: Hoare triple {27690#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {27690#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {27690#(< ~counter~0 39)} is VALID [2022-04-28 14:11:43,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {27718#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27690#(< ~counter~0 39)} is VALID [2022-04-28 14:11:43,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {27718#(< ~counter~0 38)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27718#(< ~counter~0 38)} is VALID [2022-04-28 14:11:43,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {27718#(< ~counter~0 38)} assume !!(0 != ~a~0 && 0 != ~b~0); {27718#(< ~counter~0 38)} is VALID [2022-04-28 14:11:43,739 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26888#true} {27718#(< ~counter~0 38)} #71#return; {27718#(< ~counter~0 38)} is VALID [2022-04-28 14:11:43,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,739 INFO L272 TraceCheckUtils]: 32: Hoare triple {27718#(< ~counter~0 38)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {27718#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {27718#(< ~counter~0 38)} is VALID [2022-04-28 14:11:43,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {27746#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27718#(< ~counter~0 38)} is VALID [2022-04-28 14:11:43,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {27746#(< ~counter~0 37)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27746#(< ~counter~0 37)} is VALID [2022-04-28 14:11:43,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {27746#(< ~counter~0 37)} assume !!(0 != ~a~0 && 0 != ~b~0); {27746#(< ~counter~0 37)} is VALID [2022-04-28 14:11:43,741 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26888#true} {27746#(< ~counter~0 37)} #71#return; {27746#(< ~counter~0 37)} is VALID [2022-04-28 14:11:43,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,742 INFO L272 TraceCheckUtils]: 23: Hoare triple {27746#(< ~counter~0 37)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {27746#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {27746#(< ~counter~0 37)} is VALID [2022-04-28 14:11:43,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {27774#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27746#(< ~counter~0 37)} is VALID [2022-04-28 14:11:43,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {27774#(< ~counter~0 36)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27774#(< ~counter~0 36)} is VALID [2022-04-28 14:11:43,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {27774#(< ~counter~0 36)} assume !!(0 != ~a~0 && 0 != ~b~0); {27774#(< ~counter~0 36)} is VALID [2022-04-28 14:11:43,744 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26888#true} {27774#(< ~counter~0 36)} #71#return; {27774#(< ~counter~0 36)} is VALID [2022-04-28 14:11:43,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,744 INFO L272 TraceCheckUtils]: 14: Hoare triple {27774#(< ~counter~0 36)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {27774#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {27774#(< ~counter~0 36)} is VALID [2022-04-28 14:11:43,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {27802#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27774#(< ~counter~0 36)} is VALID [2022-04-28 14:11:43,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {27802#(< ~counter~0 35)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26888#true} {27802#(< ~counter~0 35)} #69#return; {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {26888#true} assume true; {26888#true} is VALID [2022-04-28 14:11:43,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {26888#true} assume !(0 == ~cond); {26888#true} is VALID [2022-04-28 14:11:43,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {26888#true} ~cond := #in~cond; {26888#true} is VALID [2022-04-28 14:11:43,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {27802#(< ~counter~0 35)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26888#true} is VALID [2022-04-28 14:11:43,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {27802#(< ~counter~0 35)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {27802#(< ~counter~0 35)} call #t~ret7 := main(); {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27802#(< ~counter~0 35)} {26888#true} #77#return; {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {27802#(< ~counter~0 35)} assume true; {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {26888#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27802#(< ~counter~0 35)} is VALID [2022-04-28 14:11:43,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {26888#true} call ULTIMATE.init(); {26888#true} is VALID [2022-04-28 14:11:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 30 proven. 555 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 14:11:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732615731] [2022-04-28 14:11:43,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085973113] [2022-04-28 14:11:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085973113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:11:43,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:11:43,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 14:11:43,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809268228] [2022-04-28 14:11:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809268228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:43,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:43,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 14:11:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725062556] [2022-04-28 14:11:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:43,751 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 153 [2022-04-28 14:11:43,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:43,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:11:43,894 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-28 14:11:43,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 14:11:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 14:11:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 14:11:43,896 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:11:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:44,842 INFO L93 Difference]: Finished difference Result 216 states and 267 transitions. [2022-04-28 14:11:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 14:11:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 153 [2022-04-28 14:11:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:11:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 253 transitions. [2022-04-28 14:11:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:11:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 253 transitions. [2022-04-28 14:11:44,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 253 transitions. [2022-04-28 14:11:45,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:11:45,064 INFO L225 Difference]: With dead ends: 216 [2022-04-28 14:11:45,064 INFO L226 Difference]: Without dead ends: 208 [2022-04-28 14:11:45,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 14:11:45,065 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 194 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:11:45,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 282 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:11:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-28 14:11:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-04-28 14:11:45,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:45,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:11:45,424 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:11:45,425 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:11:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:45,433 INFO L93 Difference]: Finished difference Result 208 states and 258 transitions. [2022-04-28 14:11:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-28 14:11:45,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:45,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:45,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 208 states. [2022-04-28 14:11:45,434 INFO L87 Difference]: Start difference. First operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 208 states. [2022-04-28 14:11:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:45,437 INFO L93 Difference]: Finished difference Result 208 states and 258 transitions. [2022-04-28 14:11:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-28 14:11:45,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:45,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:45,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:45,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:11:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2022-04-28 14:11:45,442 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 153 [2022-04-28 14:11:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:45,442 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2022-04-28 14:11:45,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 14:11:45,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 258 transitions. [2022-04-28 14:12:17,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 243 inductive. 0 not inductive. 15 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-28 14:12:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 14:12:17,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:12:17,955 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:12:17,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 14:12:18,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 14:12:18,167 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:12:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:12:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1002092794, now seen corresponding path program 31 times [2022-04-28 14:12:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:12:18,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652355442] [2022-04-28 14:12:24,217 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:12:24,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:12:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1002092794, now seen corresponding path program 32 times [2022-04-28 14:12:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:12:24,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513657848] [2022-04-28 14:12:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:12:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:12:24,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:12:24,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473178211] [2022-04-28 14:12:24,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:12:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:12:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:12:24,244 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:12:24,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 14:12:24,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:12:24,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:12:24,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 14:12:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:12:24,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:12:25,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {29135#true} call ULTIMATE.init(); {29135#true} is VALID [2022-04-28 14:12:25,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {29135#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {29143#(<= ~counter~0 0)} assume true; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29143#(<= ~counter~0 0)} {29135#true} #77#return; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {29143#(<= ~counter~0 0)} call #t~ret7 := main(); {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {29143#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {29143#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {29143#(<= ~counter~0 0)} ~cond := #in~cond; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {29143#(<= ~counter~0 0)} assume !(0 == ~cond); {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {29143#(<= ~counter~0 0)} assume true; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29143#(<= ~counter~0 0)} {29143#(<= ~counter~0 0)} #69#return; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {29143#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {29143#(<= ~counter~0 0)} is VALID [2022-04-28 14:12:25,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {29143#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {29177#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,220 INFO L272 TraceCheckUtils]: 14: Hoare triple {29177#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {29177#(<= ~counter~0 1)} ~cond := #in~cond; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {29177#(<= ~counter~0 1)} assume !(0 == ~cond); {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {29177#(<= ~counter~0 1)} assume true; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,221 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29177#(<= ~counter~0 1)} {29177#(<= ~counter~0 1)} #71#return; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {29177#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {29177#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29177#(<= ~counter~0 1)} is VALID [2022-04-28 14:12:25,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {29177#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {29205#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,223 INFO L272 TraceCheckUtils]: 23: Hoare triple {29205#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {29205#(<= ~counter~0 2)} ~cond := #in~cond; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {29205#(<= ~counter~0 2)} assume !(0 == ~cond); {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {29205#(<= ~counter~0 2)} assume true; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,225 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29205#(<= ~counter~0 2)} {29205#(<= ~counter~0 2)} #71#return; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {29205#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {29205#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29205#(<= ~counter~0 2)} is VALID [2022-04-28 14:12:25,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {29205#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {29233#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,227 INFO L272 TraceCheckUtils]: 32: Hoare triple {29233#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {29233#(<= ~counter~0 3)} ~cond := #in~cond; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {29233#(<= ~counter~0 3)} assume !(0 == ~cond); {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {29233#(<= ~counter~0 3)} assume true; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,228 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29233#(<= ~counter~0 3)} {29233#(<= ~counter~0 3)} #71#return; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {29233#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {29233#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29233#(<= ~counter~0 3)} is VALID [2022-04-28 14:12:25,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {29233#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {29261#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,230 INFO L272 TraceCheckUtils]: 41: Hoare triple {29261#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {29261#(<= ~counter~0 4)} ~cond := #in~cond; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {29261#(<= ~counter~0 4)} assume !(0 == ~cond); {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {29261#(<= ~counter~0 4)} assume true; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,232 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29261#(<= ~counter~0 4)} {29261#(<= ~counter~0 4)} #71#return; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {29261#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {29261#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29261#(<= ~counter~0 4)} is VALID [2022-04-28 14:12:25,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {29261#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {29289#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,234 INFO L272 TraceCheckUtils]: 50: Hoare triple {29289#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {29289#(<= ~counter~0 5)} ~cond := #in~cond; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {29289#(<= ~counter~0 5)} assume !(0 == ~cond); {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {29289#(<= ~counter~0 5)} assume true; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,235 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29289#(<= ~counter~0 5)} {29289#(<= ~counter~0 5)} #71#return; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {29289#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {29289#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29289#(<= ~counter~0 5)} is VALID [2022-04-28 14:12:25,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {29289#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {29317#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,237 INFO L272 TraceCheckUtils]: 59: Hoare triple {29317#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {29317#(<= ~counter~0 6)} ~cond := #in~cond; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {29317#(<= ~counter~0 6)} assume !(0 == ~cond); {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {29317#(<= ~counter~0 6)} assume true; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,238 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29317#(<= ~counter~0 6)} {29317#(<= ~counter~0 6)} #71#return; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,239 INFO L290 TraceCheckUtils]: 64: Hoare triple {29317#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,239 INFO L290 TraceCheckUtils]: 65: Hoare triple {29317#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29317#(<= ~counter~0 6)} is VALID [2022-04-28 14:12:25,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {29317#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {29345#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,240 INFO L272 TraceCheckUtils]: 68: Hoare triple {29345#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {29345#(<= ~counter~0 7)} ~cond := #in~cond; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {29345#(<= ~counter~0 7)} assume !(0 == ~cond); {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,241 INFO L290 TraceCheckUtils]: 71: Hoare triple {29345#(<= ~counter~0 7)} assume true; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,242 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29345#(<= ~counter~0 7)} {29345#(<= ~counter~0 7)} #71#return; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {29345#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {29345#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29345#(<= ~counter~0 7)} is VALID [2022-04-28 14:12:25,243 INFO L290 TraceCheckUtils]: 75: Hoare triple {29345#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,243 INFO L290 TraceCheckUtils]: 76: Hoare triple {29373#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,244 INFO L272 TraceCheckUtils]: 77: Hoare triple {29373#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {29373#(<= ~counter~0 8)} ~cond := #in~cond; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,244 INFO L290 TraceCheckUtils]: 79: Hoare triple {29373#(<= ~counter~0 8)} assume !(0 == ~cond); {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,244 INFO L290 TraceCheckUtils]: 80: Hoare triple {29373#(<= ~counter~0 8)} assume true; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,245 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29373#(<= ~counter~0 8)} {29373#(<= ~counter~0 8)} #71#return; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {29373#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,245 INFO L290 TraceCheckUtils]: 83: Hoare triple {29373#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29373#(<= ~counter~0 8)} is VALID [2022-04-28 14:12:25,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {29373#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {29401#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,247 INFO L272 TraceCheckUtils]: 86: Hoare triple {29401#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {29401#(<= ~counter~0 9)} ~cond := #in~cond; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {29401#(<= ~counter~0 9)} assume !(0 == ~cond); {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,248 INFO L290 TraceCheckUtils]: 89: Hoare triple {29401#(<= ~counter~0 9)} assume true; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,248 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29401#(<= ~counter~0 9)} {29401#(<= ~counter~0 9)} #71#return; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,248 INFO L290 TraceCheckUtils]: 91: Hoare triple {29401#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {29401#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29401#(<= ~counter~0 9)} is VALID [2022-04-28 14:12:25,249 INFO L290 TraceCheckUtils]: 93: Hoare triple {29401#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,250 INFO L290 TraceCheckUtils]: 94: Hoare triple {29429#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,250 INFO L272 TraceCheckUtils]: 95: Hoare triple {29429#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,250 INFO L290 TraceCheckUtils]: 96: Hoare triple {29429#(<= ~counter~0 10)} ~cond := #in~cond; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,251 INFO L290 TraceCheckUtils]: 97: Hoare triple {29429#(<= ~counter~0 10)} assume !(0 == ~cond); {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,251 INFO L290 TraceCheckUtils]: 98: Hoare triple {29429#(<= ~counter~0 10)} assume true; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,251 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {29429#(<= ~counter~0 10)} {29429#(<= ~counter~0 10)} #71#return; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,252 INFO L290 TraceCheckUtils]: 100: Hoare triple {29429#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,252 INFO L290 TraceCheckUtils]: 101: Hoare triple {29429#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29429#(<= ~counter~0 10)} is VALID [2022-04-28 14:12:25,252 INFO L290 TraceCheckUtils]: 102: Hoare triple {29429#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,253 INFO L290 TraceCheckUtils]: 103: Hoare triple {29457#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,253 INFO L272 TraceCheckUtils]: 104: Hoare triple {29457#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {29457#(<= ~counter~0 11)} ~cond := #in~cond; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {29457#(<= ~counter~0 11)} assume !(0 == ~cond); {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {29457#(<= ~counter~0 11)} assume true; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,272 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29457#(<= ~counter~0 11)} {29457#(<= ~counter~0 11)} #71#return; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {29457#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,273 INFO L290 TraceCheckUtils]: 110: Hoare triple {29457#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29457#(<= ~counter~0 11)} is VALID [2022-04-28 14:12:25,274 INFO L290 TraceCheckUtils]: 111: Hoare triple {29457#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,275 INFO L290 TraceCheckUtils]: 112: Hoare triple {29485#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,276 INFO L272 TraceCheckUtils]: 113: Hoare triple {29485#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,276 INFO L290 TraceCheckUtils]: 114: Hoare triple {29485#(<= ~counter~0 12)} ~cond := #in~cond; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,277 INFO L290 TraceCheckUtils]: 115: Hoare triple {29485#(<= ~counter~0 12)} assume !(0 == ~cond); {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,277 INFO L290 TraceCheckUtils]: 116: Hoare triple {29485#(<= ~counter~0 12)} assume true; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,279 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29485#(<= ~counter~0 12)} {29485#(<= ~counter~0 12)} #71#return; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,279 INFO L290 TraceCheckUtils]: 118: Hoare triple {29485#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,280 INFO L290 TraceCheckUtils]: 119: Hoare triple {29485#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29485#(<= ~counter~0 12)} is VALID [2022-04-28 14:12:25,281 INFO L290 TraceCheckUtils]: 120: Hoare triple {29485#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,281 INFO L290 TraceCheckUtils]: 121: Hoare triple {29513#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,282 INFO L272 TraceCheckUtils]: 122: Hoare triple {29513#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,283 INFO L290 TraceCheckUtils]: 123: Hoare triple {29513#(<= ~counter~0 13)} ~cond := #in~cond; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,283 INFO L290 TraceCheckUtils]: 124: Hoare triple {29513#(<= ~counter~0 13)} assume !(0 == ~cond); {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,284 INFO L290 TraceCheckUtils]: 125: Hoare triple {29513#(<= ~counter~0 13)} assume true; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,285 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {29513#(<= ~counter~0 13)} {29513#(<= ~counter~0 13)} #71#return; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,285 INFO L290 TraceCheckUtils]: 127: Hoare triple {29513#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,286 INFO L290 TraceCheckUtils]: 128: Hoare triple {29513#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29513#(<= ~counter~0 13)} is VALID [2022-04-28 14:12:25,287 INFO L290 TraceCheckUtils]: 129: Hoare triple {29513#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,287 INFO L290 TraceCheckUtils]: 130: Hoare triple {29541#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,289 INFO L272 TraceCheckUtils]: 131: Hoare triple {29541#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,289 INFO L290 TraceCheckUtils]: 132: Hoare triple {29541#(<= ~counter~0 14)} ~cond := #in~cond; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,290 INFO L290 TraceCheckUtils]: 133: Hoare triple {29541#(<= ~counter~0 14)} assume !(0 == ~cond); {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,290 INFO L290 TraceCheckUtils]: 134: Hoare triple {29541#(<= ~counter~0 14)} assume true; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,291 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29541#(<= ~counter~0 14)} {29541#(<= ~counter~0 14)} #71#return; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,292 INFO L290 TraceCheckUtils]: 136: Hoare triple {29541#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,292 INFO L290 TraceCheckUtils]: 137: Hoare triple {29541#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29541#(<= ~counter~0 14)} is VALID [2022-04-28 14:12:25,293 INFO L290 TraceCheckUtils]: 138: Hoare triple {29541#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,293 INFO L290 TraceCheckUtils]: 139: Hoare triple {29569#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,294 INFO L272 TraceCheckUtils]: 140: Hoare triple {29569#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,294 INFO L290 TraceCheckUtils]: 141: Hoare triple {29569#(<= ~counter~0 15)} ~cond := #in~cond; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,295 INFO L290 TraceCheckUtils]: 142: Hoare triple {29569#(<= ~counter~0 15)} assume !(0 == ~cond); {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,295 INFO L290 TraceCheckUtils]: 143: Hoare triple {29569#(<= ~counter~0 15)} assume true; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,296 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29569#(<= ~counter~0 15)} {29569#(<= ~counter~0 15)} #71#return; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,296 INFO L290 TraceCheckUtils]: 145: Hoare triple {29569#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,297 INFO L290 TraceCheckUtils]: 146: Hoare triple {29569#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29569#(<= ~counter~0 15)} is VALID [2022-04-28 14:12:25,297 INFO L290 TraceCheckUtils]: 147: Hoare triple {29569#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,298 INFO L290 TraceCheckUtils]: 148: Hoare triple {29597#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,298 INFO L272 TraceCheckUtils]: 149: Hoare triple {29597#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,299 INFO L290 TraceCheckUtils]: 150: Hoare triple {29597#(<= ~counter~0 16)} ~cond := #in~cond; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,299 INFO L290 TraceCheckUtils]: 151: Hoare triple {29597#(<= ~counter~0 16)} assume !(0 == ~cond); {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,300 INFO L290 TraceCheckUtils]: 152: Hoare triple {29597#(<= ~counter~0 16)} assume true; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,300 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {29597#(<= ~counter~0 16)} {29597#(<= ~counter~0 16)} #71#return; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,301 INFO L290 TraceCheckUtils]: 154: Hoare triple {29597#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,301 INFO L290 TraceCheckUtils]: 155: Hoare triple {29597#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29597#(<= ~counter~0 16)} is VALID [2022-04-28 14:12:25,301 INFO L290 TraceCheckUtils]: 156: Hoare triple {29597#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29625#(<= |main_#t~post6| 16)} is VALID [2022-04-28 14:12:25,302 INFO L290 TraceCheckUtils]: 157: Hoare triple {29625#(<= |main_#t~post6| 16)} assume !(#t~post6 < 50);havoc #t~post6; {29136#false} is VALID [2022-04-28 14:12:25,302 INFO L272 TraceCheckUtils]: 158: Hoare triple {29136#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {29136#false} is VALID [2022-04-28 14:12:25,302 INFO L290 TraceCheckUtils]: 159: Hoare triple {29136#false} ~cond := #in~cond; {29136#false} is VALID [2022-04-28 14:12:25,302 INFO L290 TraceCheckUtils]: 160: Hoare triple {29136#false} assume 0 == ~cond; {29136#false} is VALID [2022-04-28 14:12:25,302 INFO L290 TraceCheckUtils]: 161: Hoare triple {29136#false} assume !false; {29136#false} is VALID [2022-04-28 14:12:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 32 proven. 1112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:12:25,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:12:26,390 INFO L290 TraceCheckUtils]: 161: Hoare triple {29136#false} assume !false; {29136#false} is VALID [2022-04-28 14:12:26,391 INFO L290 TraceCheckUtils]: 160: Hoare triple {29136#false} assume 0 == ~cond; {29136#false} is VALID [2022-04-28 14:12:26,391 INFO L290 TraceCheckUtils]: 159: Hoare triple {29136#false} ~cond := #in~cond; {29136#false} is VALID [2022-04-28 14:12:26,391 INFO L272 TraceCheckUtils]: 158: Hoare triple {29136#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {29136#false} is VALID [2022-04-28 14:12:26,391 INFO L290 TraceCheckUtils]: 157: Hoare triple {29653#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {29136#false} is VALID [2022-04-28 14:12:26,391 INFO L290 TraceCheckUtils]: 156: Hoare triple {29657#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29653#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:12:26,392 INFO L290 TraceCheckUtils]: 155: Hoare triple {29657#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29657#(< ~counter~0 50)} is VALID [2022-04-28 14:12:26,392 INFO L290 TraceCheckUtils]: 154: Hoare triple {29657#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {29657#(< ~counter~0 50)} is VALID [2022-04-28 14:12:26,392 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {29135#true} {29657#(< ~counter~0 50)} #71#return; {29657#(< ~counter~0 50)} is VALID [2022-04-28 14:12:26,393 INFO L290 TraceCheckUtils]: 152: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,393 INFO L290 TraceCheckUtils]: 151: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,393 INFO L290 TraceCheckUtils]: 150: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,393 INFO L272 TraceCheckUtils]: 149: Hoare triple {29657#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,393 INFO L290 TraceCheckUtils]: 148: Hoare triple {29657#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {29657#(< ~counter~0 50)} is VALID [2022-04-28 14:12:26,394 INFO L290 TraceCheckUtils]: 147: Hoare triple {29685#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29657#(< ~counter~0 50)} is VALID [2022-04-28 14:12:26,394 INFO L290 TraceCheckUtils]: 146: Hoare triple {29685#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29685#(< ~counter~0 49)} is VALID [2022-04-28 14:12:26,394 INFO L290 TraceCheckUtils]: 145: Hoare triple {29685#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {29685#(< ~counter~0 49)} is VALID [2022-04-28 14:12:26,395 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29135#true} {29685#(< ~counter~0 49)} #71#return; {29685#(< ~counter~0 49)} is VALID [2022-04-28 14:12:26,395 INFO L290 TraceCheckUtils]: 143: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,395 INFO L290 TraceCheckUtils]: 142: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,395 INFO L290 TraceCheckUtils]: 141: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,395 INFO L272 TraceCheckUtils]: 140: Hoare triple {29685#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,395 INFO L290 TraceCheckUtils]: 139: Hoare triple {29685#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {29685#(< ~counter~0 49)} is VALID [2022-04-28 14:12:26,396 INFO L290 TraceCheckUtils]: 138: Hoare triple {29713#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29685#(< ~counter~0 49)} is VALID [2022-04-28 14:12:26,396 INFO L290 TraceCheckUtils]: 137: Hoare triple {29713#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29713#(< ~counter~0 48)} is VALID [2022-04-28 14:12:26,397 INFO L290 TraceCheckUtils]: 136: Hoare triple {29713#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {29713#(< ~counter~0 48)} is VALID [2022-04-28 14:12:26,397 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29135#true} {29713#(< ~counter~0 48)} #71#return; {29713#(< ~counter~0 48)} is VALID [2022-04-28 14:12:26,397 INFO L290 TraceCheckUtils]: 134: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,397 INFO L290 TraceCheckUtils]: 133: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,397 INFO L290 TraceCheckUtils]: 132: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,397 INFO L272 TraceCheckUtils]: 131: Hoare triple {29713#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,398 INFO L290 TraceCheckUtils]: 130: Hoare triple {29713#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {29713#(< ~counter~0 48)} is VALID [2022-04-28 14:12:26,398 INFO L290 TraceCheckUtils]: 129: Hoare triple {29741#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29713#(< ~counter~0 48)} is VALID [2022-04-28 14:12:26,398 INFO L290 TraceCheckUtils]: 128: Hoare triple {29741#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29741#(< ~counter~0 47)} is VALID [2022-04-28 14:12:26,399 INFO L290 TraceCheckUtils]: 127: Hoare triple {29741#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {29741#(< ~counter~0 47)} is VALID [2022-04-28 14:12:26,399 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {29135#true} {29741#(< ~counter~0 47)} #71#return; {29741#(< ~counter~0 47)} is VALID [2022-04-28 14:12:26,399 INFO L290 TraceCheckUtils]: 125: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,399 INFO L290 TraceCheckUtils]: 124: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,399 INFO L290 TraceCheckUtils]: 123: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,400 INFO L272 TraceCheckUtils]: 122: Hoare triple {29741#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,400 INFO L290 TraceCheckUtils]: 121: Hoare triple {29741#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {29741#(< ~counter~0 47)} is VALID [2022-04-28 14:12:26,400 INFO L290 TraceCheckUtils]: 120: Hoare triple {29769#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29741#(< ~counter~0 47)} is VALID [2022-04-28 14:12:26,401 INFO L290 TraceCheckUtils]: 119: Hoare triple {29769#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29769#(< ~counter~0 46)} is VALID [2022-04-28 14:12:26,401 INFO L290 TraceCheckUtils]: 118: Hoare triple {29769#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {29769#(< ~counter~0 46)} is VALID [2022-04-28 14:12:26,401 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29135#true} {29769#(< ~counter~0 46)} #71#return; {29769#(< ~counter~0 46)} is VALID [2022-04-28 14:12:26,401 INFO L290 TraceCheckUtils]: 116: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,402 INFO L290 TraceCheckUtils]: 115: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,402 INFO L290 TraceCheckUtils]: 114: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,402 INFO L272 TraceCheckUtils]: 113: Hoare triple {29769#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,402 INFO L290 TraceCheckUtils]: 112: Hoare triple {29769#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {29769#(< ~counter~0 46)} is VALID [2022-04-28 14:12:26,402 INFO L290 TraceCheckUtils]: 111: Hoare triple {29797#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29769#(< ~counter~0 46)} is VALID [2022-04-28 14:12:26,403 INFO L290 TraceCheckUtils]: 110: Hoare triple {29797#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29797#(< ~counter~0 45)} is VALID [2022-04-28 14:12:26,403 INFO L290 TraceCheckUtils]: 109: Hoare triple {29797#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {29797#(< ~counter~0 45)} is VALID [2022-04-28 14:12:26,404 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29135#true} {29797#(< ~counter~0 45)} #71#return; {29797#(< ~counter~0 45)} is VALID [2022-04-28 14:12:26,404 INFO L290 TraceCheckUtils]: 107: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,404 INFO L290 TraceCheckUtils]: 106: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,404 INFO L290 TraceCheckUtils]: 105: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,404 INFO L272 TraceCheckUtils]: 104: Hoare triple {29797#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,404 INFO L290 TraceCheckUtils]: 103: Hoare triple {29797#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {29797#(< ~counter~0 45)} is VALID [2022-04-28 14:12:26,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {29825#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29797#(< ~counter~0 45)} is VALID [2022-04-28 14:12:26,405 INFO L290 TraceCheckUtils]: 101: Hoare triple {29825#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29825#(< ~counter~0 44)} is VALID [2022-04-28 14:12:26,405 INFO L290 TraceCheckUtils]: 100: Hoare triple {29825#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {29825#(< ~counter~0 44)} is VALID [2022-04-28 14:12:26,406 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {29135#true} {29825#(< ~counter~0 44)} #71#return; {29825#(< ~counter~0 44)} is VALID [2022-04-28 14:12:26,406 INFO L290 TraceCheckUtils]: 98: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,406 INFO L290 TraceCheckUtils]: 97: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,406 INFO L290 TraceCheckUtils]: 96: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,406 INFO L272 TraceCheckUtils]: 95: Hoare triple {29825#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {29825#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {29825#(< ~counter~0 44)} is VALID [2022-04-28 14:12:26,407 INFO L290 TraceCheckUtils]: 93: Hoare triple {29853#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29825#(< ~counter~0 44)} is VALID [2022-04-28 14:12:26,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {29853#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29853#(< ~counter~0 43)} is VALID [2022-04-28 14:12:26,407 INFO L290 TraceCheckUtils]: 91: Hoare triple {29853#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {29853#(< ~counter~0 43)} is VALID [2022-04-28 14:12:26,408 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29135#true} {29853#(< ~counter~0 43)} #71#return; {29853#(< ~counter~0 43)} is VALID [2022-04-28 14:12:26,408 INFO L290 TraceCheckUtils]: 89: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,408 INFO L290 TraceCheckUtils]: 88: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,408 INFO L290 TraceCheckUtils]: 87: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,408 INFO L272 TraceCheckUtils]: 86: Hoare triple {29853#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,409 INFO L290 TraceCheckUtils]: 85: Hoare triple {29853#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {29853#(< ~counter~0 43)} is VALID [2022-04-28 14:12:26,409 INFO L290 TraceCheckUtils]: 84: Hoare triple {29881#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29853#(< ~counter~0 43)} is VALID [2022-04-28 14:12:26,409 INFO L290 TraceCheckUtils]: 83: Hoare triple {29881#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29881#(< ~counter~0 42)} is VALID [2022-04-28 14:12:26,410 INFO L290 TraceCheckUtils]: 82: Hoare triple {29881#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {29881#(< ~counter~0 42)} is VALID [2022-04-28 14:12:26,410 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29135#true} {29881#(< ~counter~0 42)} #71#return; {29881#(< ~counter~0 42)} is VALID [2022-04-28 14:12:26,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,411 INFO L272 TraceCheckUtils]: 77: Hoare triple {29881#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {29881#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {29881#(< ~counter~0 42)} is VALID [2022-04-28 14:12:26,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {29909#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29881#(< ~counter~0 42)} is VALID [2022-04-28 14:12:26,412 INFO L290 TraceCheckUtils]: 74: Hoare triple {29909#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29909#(< ~counter~0 41)} is VALID [2022-04-28 14:12:26,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {29909#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {29909#(< ~counter~0 41)} is VALID [2022-04-28 14:12:26,412 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29135#true} {29909#(< ~counter~0 41)} #71#return; {29909#(< ~counter~0 41)} is VALID [2022-04-28 14:12:26,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,413 INFO L272 TraceCheckUtils]: 68: Hoare triple {29909#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {29909#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {29909#(< ~counter~0 41)} is VALID [2022-04-28 14:12:26,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {29937#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29909#(< ~counter~0 41)} is VALID [2022-04-28 14:12:26,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {29937#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29937#(< ~counter~0 40)} is VALID [2022-04-28 14:12:26,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {29937#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {29937#(< ~counter~0 40)} is VALID [2022-04-28 14:12:26,414 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29135#true} {29937#(< ~counter~0 40)} #71#return; {29937#(< ~counter~0 40)} is VALID [2022-04-28 14:12:26,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,415 INFO L272 TraceCheckUtils]: 59: Hoare triple {29937#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {29937#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {29937#(< ~counter~0 40)} is VALID [2022-04-28 14:12:26,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {29965#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29937#(< ~counter~0 40)} is VALID [2022-04-28 14:12:26,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {29965#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29965#(< ~counter~0 39)} is VALID [2022-04-28 14:12:26,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {29965#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {29965#(< ~counter~0 39)} is VALID [2022-04-28 14:12:26,423 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29135#true} {29965#(< ~counter~0 39)} #71#return; {29965#(< ~counter~0 39)} is VALID [2022-04-28 14:12:26,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,424 INFO L272 TraceCheckUtils]: 50: Hoare triple {29965#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {29965#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {29965#(< ~counter~0 39)} is VALID [2022-04-28 14:12:26,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {29993#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29965#(< ~counter~0 39)} is VALID [2022-04-28 14:12:26,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {29993#(< ~counter~0 38)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29993#(< ~counter~0 38)} is VALID [2022-04-28 14:12:26,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {29993#(< ~counter~0 38)} assume !!(0 != ~a~0 && 0 != ~b~0); {29993#(< ~counter~0 38)} is VALID [2022-04-28 14:12:26,426 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29135#true} {29993#(< ~counter~0 38)} #71#return; {29993#(< ~counter~0 38)} is VALID [2022-04-28 14:12:26,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,426 INFO L272 TraceCheckUtils]: 41: Hoare triple {29993#(< ~counter~0 38)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {29993#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {29993#(< ~counter~0 38)} is VALID [2022-04-28 14:12:26,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {30021#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29993#(< ~counter~0 38)} is VALID [2022-04-28 14:12:26,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {30021#(< ~counter~0 37)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {30021#(< ~counter~0 37)} is VALID [2022-04-28 14:12:26,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {30021#(< ~counter~0 37)} assume !!(0 != ~a~0 && 0 != ~b~0); {30021#(< ~counter~0 37)} is VALID [2022-04-28 14:12:26,428 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29135#true} {30021#(< ~counter~0 37)} #71#return; {30021#(< ~counter~0 37)} is VALID [2022-04-28 14:12:26,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,428 INFO L272 TraceCheckUtils]: 32: Hoare triple {30021#(< ~counter~0 37)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {30021#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {30021#(< ~counter~0 37)} is VALID [2022-04-28 14:12:26,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {30049#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30021#(< ~counter~0 37)} is VALID [2022-04-28 14:12:26,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {30049#(< ~counter~0 36)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {30049#(< ~counter~0 36)} is VALID [2022-04-28 14:12:26,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {30049#(< ~counter~0 36)} assume !!(0 != ~a~0 && 0 != ~b~0); {30049#(< ~counter~0 36)} is VALID [2022-04-28 14:12:26,430 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29135#true} {30049#(< ~counter~0 36)} #71#return; {30049#(< ~counter~0 36)} is VALID [2022-04-28 14:12:26,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,430 INFO L272 TraceCheckUtils]: 23: Hoare triple {30049#(< ~counter~0 36)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {30049#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {30049#(< ~counter~0 36)} is VALID [2022-04-28 14:12:26,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {30077#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30049#(< ~counter~0 36)} is VALID [2022-04-28 14:12:26,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {30077#(< ~counter~0 35)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {30077#(< ~counter~0 35)} is VALID [2022-04-28 14:12:26,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {30077#(< ~counter~0 35)} assume !!(0 != ~a~0 && 0 != ~b~0); {30077#(< ~counter~0 35)} is VALID [2022-04-28 14:12:26,432 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29135#true} {30077#(< ~counter~0 35)} #71#return; {30077#(< ~counter~0 35)} is VALID [2022-04-28 14:12:26,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,433 INFO L272 TraceCheckUtils]: 14: Hoare triple {30077#(< ~counter~0 35)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {30077#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {30077#(< ~counter~0 35)} is VALID [2022-04-28 14:12:26,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {30105#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30077#(< ~counter~0 35)} is VALID [2022-04-28 14:12:26,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {30105#(< ~counter~0 34)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29135#true} {30105#(< ~counter~0 34)} #69#return; {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {29135#true} assume true; {29135#true} is VALID [2022-04-28 14:12:26,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {29135#true} assume !(0 == ~cond); {29135#true} is VALID [2022-04-28 14:12:26,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {29135#true} ~cond := #in~cond; {29135#true} is VALID [2022-04-28 14:12:26,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {30105#(< ~counter~0 34)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29135#true} is VALID [2022-04-28 14:12:26,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {30105#(< ~counter~0 34)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {30105#(< ~counter~0 34)} call #t~ret7 := main(); {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30105#(< ~counter~0 34)} {29135#true} #77#return; {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {30105#(< ~counter~0 34)} assume true; {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {29135#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30105#(< ~counter~0 34)} is VALID [2022-04-28 14:12:26,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {29135#true} call ULTIMATE.init(); {29135#true} is VALID [2022-04-28 14:12:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 32 proven. 632 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 14:12:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:12:26,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513657848] [2022-04-28 14:12:26,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:12:26,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473178211] [2022-04-28 14:12:26,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473178211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:12:26,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:12:26,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-28 14:12:26,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:12:26,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652355442] [2022-04-28 14:12:26,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652355442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:12:26,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:12:26,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 14:12:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850553123] [2022-04-28 14:12:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:12:26,439 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 162 [2022-04-28 14:12:26,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:12:26,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:12:26,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:26,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 14:12:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:12:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 14:12:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 14:12:26,574 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:12:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:27,638 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2022-04-28 14:12:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 14:12:27,638 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 162 [2022-04-28 14:12:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:12:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:12:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 267 transitions. [2022-04-28 14:12:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:12:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 267 transitions. [2022-04-28 14:12:27,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 267 transitions. [2022-04-28 14:12:27,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:12:27,933 INFO L225 Difference]: With dead ends: 227 [2022-04-28 14:12:27,933 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 14:12:27,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1227, Invalid=1635, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 14:12:27,934 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 252 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:12:27,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 278 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:12:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 14:12:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-04-28 14:12:28,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:12:28,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:12:28,318 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:12:28,318 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:12:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:28,320 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2022-04-28 14:12:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-28 14:12:28,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:28,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:28,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 219 states. [2022-04-28 14:12:28,322 INFO L87 Difference]: Start difference. First operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 219 states. [2022-04-28 14:12:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:28,325 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2022-04-28 14:12:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-28 14:12:28,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:28,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:28,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:12:28,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:12:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 14:12:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 272 transitions. [2022-04-28 14:12:28,330 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 272 transitions. Word has length 162 [2022-04-28 14:12:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:12:28,330 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 272 transitions. [2022-04-28 14:12:28,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:12:28,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 272 transitions. [2022-04-28 14:13:03,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 256 inductive. 0 not inductive. 16 times theorem prover too weak to decide inductivity. [2022-04-28 14:13:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-28 14:13:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 14:13:03,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:13:03,863 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:13:03,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 14:13:04,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:13:04,063 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:13:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:13:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1155770690, now seen corresponding path program 33 times [2022-04-28 14:13:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:13:04,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342163494] [2022-04-28 14:13:10,116 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:13:10,116 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:13:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1155770690, now seen corresponding path program 34 times [2022-04-28 14:13:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:13:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399738214] [2022-04-28 14:13:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:13:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:13:10,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:13:10,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689417767] [2022-04-28 14:13:10,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:13:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:13:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:13:10,144 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:13:10,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 14:13:10,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:13:10,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:13:10,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 14:13:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:13:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:13:11,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {31506#true} call ULTIMATE.init(); {31506#true} is VALID [2022-04-28 14:13:11,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {31506#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {31514#(<= ~counter~0 0)} assume true; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31514#(<= ~counter~0 0)} {31506#true} #77#return; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {31514#(<= ~counter~0 0)} call #t~ret7 := main(); {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {31514#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {31514#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {31514#(<= ~counter~0 0)} ~cond := #in~cond; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {31514#(<= ~counter~0 0)} assume !(0 == ~cond); {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {31514#(<= ~counter~0 0)} assume true; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31514#(<= ~counter~0 0)} {31514#(<= ~counter~0 0)} #69#return; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {31514#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {31514#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:11,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {31514#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {31548#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,159 INFO L272 TraceCheckUtils]: 14: Hoare triple {31548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {31548#(<= ~counter~0 1)} ~cond := #in~cond; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {31548#(<= ~counter~0 1)} assume !(0 == ~cond); {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {31548#(<= ~counter~0 1)} assume true; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,161 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31548#(<= ~counter~0 1)} {31548#(<= ~counter~0 1)} #71#return; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {31548#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {31548#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31548#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:11,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {31548#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {31576#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,162 INFO L272 TraceCheckUtils]: 23: Hoare triple {31576#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {31576#(<= ~counter~0 2)} ~cond := #in~cond; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {31576#(<= ~counter~0 2)} assume !(0 == ~cond); {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {31576#(<= ~counter~0 2)} assume true; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,164 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31576#(<= ~counter~0 2)} {31576#(<= ~counter~0 2)} #71#return; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {31576#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {31576#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31576#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:11,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {31576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {31604#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,166 INFO L272 TraceCheckUtils]: 32: Hoare triple {31604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {31604#(<= ~counter~0 3)} ~cond := #in~cond; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {31604#(<= ~counter~0 3)} assume !(0 == ~cond); {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {31604#(<= ~counter~0 3)} assume true; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,167 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31604#(<= ~counter~0 3)} {31604#(<= ~counter~0 3)} #71#return; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {31604#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {31604#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31604#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:11,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {31604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {31632#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,169 INFO L272 TraceCheckUtils]: 41: Hoare triple {31632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {31632#(<= ~counter~0 4)} ~cond := #in~cond; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {31632#(<= ~counter~0 4)} assume !(0 == ~cond); {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {31632#(<= ~counter~0 4)} assume true; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,170 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31632#(<= ~counter~0 4)} {31632#(<= ~counter~0 4)} #71#return; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {31632#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {31632#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31632#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:11,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {31632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {31660#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,172 INFO L272 TraceCheckUtils]: 50: Hoare triple {31660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {31660#(<= ~counter~0 5)} ~cond := #in~cond; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {31660#(<= ~counter~0 5)} assume !(0 == ~cond); {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {31660#(<= ~counter~0 5)} assume true; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,173 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31660#(<= ~counter~0 5)} {31660#(<= ~counter~0 5)} #71#return; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {31660#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {31660#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31660#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:11,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {31660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {31688#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,175 INFO L272 TraceCheckUtils]: 59: Hoare triple {31688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {31688#(<= ~counter~0 6)} ~cond := #in~cond; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {31688#(<= ~counter~0 6)} assume !(0 == ~cond); {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {31688#(<= ~counter~0 6)} assume true; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,176 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31688#(<= ~counter~0 6)} {31688#(<= ~counter~0 6)} #71#return; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {31688#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {31688#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31688#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:11,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {31688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {31716#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,178 INFO L272 TraceCheckUtils]: 68: Hoare triple {31716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {31716#(<= ~counter~0 7)} ~cond := #in~cond; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {31716#(<= ~counter~0 7)} assume !(0 == ~cond); {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {31716#(<= ~counter~0 7)} assume true; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,180 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31716#(<= ~counter~0 7)} {31716#(<= ~counter~0 7)} #71#return; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,180 INFO L290 TraceCheckUtils]: 73: Hoare triple {31716#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {31716#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31716#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:11,181 INFO L290 TraceCheckUtils]: 75: Hoare triple {31716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {31744#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,182 INFO L272 TraceCheckUtils]: 77: Hoare triple {31744#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {31744#(<= ~counter~0 8)} ~cond := #in~cond; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {31744#(<= ~counter~0 8)} assume !(0 == ~cond); {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {31744#(<= ~counter~0 8)} assume true; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,183 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31744#(<= ~counter~0 8)} {31744#(<= ~counter~0 8)} #71#return; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {31744#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {31744#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31744#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:11,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {31744#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {31772#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,185 INFO L272 TraceCheckUtils]: 86: Hoare triple {31772#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {31772#(<= ~counter~0 9)} ~cond := #in~cond; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {31772#(<= ~counter~0 9)} assume !(0 == ~cond); {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {31772#(<= ~counter~0 9)} assume true; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,186 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {31772#(<= ~counter~0 9)} {31772#(<= ~counter~0 9)} #71#return; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,186 INFO L290 TraceCheckUtils]: 91: Hoare triple {31772#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,187 INFO L290 TraceCheckUtils]: 92: Hoare triple {31772#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31772#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:11,187 INFO L290 TraceCheckUtils]: 93: Hoare triple {31772#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,187 INFO L290 TraceCheckUtils]: 94: Hoare triple {31800#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,188 INFO L272 TraceCheckUtils]: 95: Hoare triple {31800#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,188 INFO L290 TraceCheckUtils]: 96: Hoare triple {31800#(<= ~counter~0 10)} ~cond := #in~cond; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,188 INFO L290 TraceCheckUtils]: 97: Hoare triple {31800#(<= ~counter~0 10)} assume !(0 == ~cond); {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,189 INFO L290 TraceCheckUtils]: 98: Hoare triple {31800#(<= ~counter~0 10)} assume true; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,189 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {31800#(<= ~counter~0 10)} {31800#(<= ~counter~0 10)} #71#return; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {31800#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,190 INFO L290 TraceCheckUtils]: 101: Hoare triple {31800#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31800#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:11,190 INFO L290 TraceCheckUtils]: 102: Hoare triple {31800#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,190 INFO L290 TraceCheckUtils]: 103: Hoare triple {31828#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,191 INFO L272 TraceCheckUtils]: 104: Hoare triple {31828#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,191 INFO L290 TraceCheckUtils]: 105: Hoare triple {31828#(<= ~counter~0 11)} ~cond := #in~cond; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,192 INFO L290 TraceCheckUtils]: 106: Hoare triple {31828#(<= ~counter~0 11)} assume !(0 == ~cond); {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,192 INFO L290 TraceCheckUtils]: 107: Hoare triple {31828#(<= ~counter~0 11)} assume true; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,192 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31828#(<= ~counter~0 11)} {31828#(<= ~counter~0 11)} #71#return; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,193 INFO L290 TraceCheckUtils]: 109: Hoare triple {31828#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,193 INFO L290 TraceCheckUtils]: 110: Hoare triple {31828#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31828#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:11,193 INFO L290 TraceCheckUtils]: 111: Hoare triple {31828#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,194 INFO L290 TraceCheckUtils]: 112: Hoare triple {31856#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,194 INFO L272 TraceCheckUtils]: 113: Hoare triple {31856#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,194 INFO L290 TraceCheckUtils]: 114: Hoare triple {31856#(<= ~counter~0 12)} ~cond := #in~cond; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,195 INFO L290 TraceCheckUtils]: 115: Hoare triple {31856#(<= ~counter~0 12)} assume !(0 == ~cond); {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,195 INFO L290 TraceCheckUtils]: 116: Hoare triple {31856#(<= ~counter~0 12)} assume true; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,196 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {31856#(<= ~counter~0 12)} {31856#(<= ~counter~0 12)} #71#return; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,196 INFO L290 TraceCheckUtils]: 118: Hoare triple {31856#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,196 INFO L290 TraceCheckUtils]: 119: Hoare triple {31856#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31856#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:11,197 INFO L290 TraceCheckUtils]: 120: Hoare triple {31856#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,197 INFO L290 TraceCheckUtils]: 121: Hoare triple {31884#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,197 INFO L272 TraceCheckUtils]: 122: Hoare triple {31884#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,198 INFO L290 TraceCheckUtils]: 123: Hoare triple {31884#(<= ~counter~0 13)} ~cond := #in~cond; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,198 INFO L290 TraceCheckUtils]: 124: Hoare triple {31884#(<= ~counter~0 13)} assume !(0 == ~cond); {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,198 INFO L290 TraceCheckUtils]: 125: Hoare triple {31884#(<= ~counter~0 13)} assume true; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,199 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {31884#(<= ~counter~0 13)} {31884#(<= ~counter~0 13)} #71#return; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,199 INFO L290 TraceCheckUtils]: 127: Hoare triple {31884#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,199 INFO L290 TraceCheckUtils]: 128: Hoare triple {31884#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31884#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:11,200 INFO L290 TraceCheckUtils]: 129: Hoare triple {31884#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,200 INFO L290 TraceCheckUtils]: 130: Hoare triple {31912#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,201 INFO L272 TraceCheckUtils]: 131: Hoare triple {31912#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,201 INFO L290 TraceCheckUtils]: 132: Hoare triple {31912#(<= ~counter~0 14)} ~cond := #in~cond; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,201 INFO L290 TraceCheckUtils]: 133: Hoare triple {31912#(<= ~counter~0 14)} assume !(0 == ~cond); {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,201 INFO L290 TraceCheckUtils]: 134: Hoare triple {31912#(<= ~counter~0 14)} assume true; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,202 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31912#(<= ~counter~0 14)} {31912#(<= ~counter~0 14)} #71#return; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,202 INFO L290 TraceCheckUtils]: 136: Hoare triple {31912#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,202 INFO L290 TraceCheckUtils]: 137: Hoare triple {31912#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31912#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:11,203 INFO L290 TraceCheckUtils]: 138: Hoare triple {31912#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,203 INFO L290 TraceCheckUtils]: 139: Hoare triple {31940#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,204 INFO L272 TraceCheckUtils]: 140: Hoare triple {31940#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,204 INFO L290 TraceCheckUtils]: 141: Hoare triple {31940#(<= ~counter~0 15)} ~cond := #in~cond; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,204 INFO L290 TraceCheckUtils]: 142: Hoare triple {31940#(<= ~counter~0 15)} assume !(0 == ~cond); {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,205 INFO L290 TraceCheckUtils]: 143: Hoare triple {31940#(<= ~counter~0 15)} assume true; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,205 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31940#(<= ~counter~0 15)} {31940#(<= ~counter~0 15)} #71#return; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,205 INFO L290 TraceCheckUtils]: 145: Hoare triple {31940#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,206 INFO L290 TraceCheckUtils]: 146: Hoare triple {31940#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31940#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:11,206 INFO L290 TraceCheckUtils]: 147: Hoare triple {31940#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,206 INFO L290 TraceCheckUtils]: 148: Hoare triple {31968#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,207 INFO L272 TraceCheckUtils]: 149: Hoare triple {31968#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,207 INFO L290 TraceCheckUtils]: 150: Hoare triple {31968#(<= ~counter~0 16)} ~cond := #in~cond; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,208 INFO L290 TraceCheckUtils]: 151: Hoare triple {31968#(<= ~counter~0 16)} assume !(0 == ~cond); {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,208 INFO L290 TraceCheckUtils]: 152: Hoare triple {31968#(<= ~counter~0 16)} assume true; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,208 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {31968#(<= ~counter~0 16)} {31968#(<= ~counter~0 16)} #71#return; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,209 INFO L290 TraceCheckUtils]: 154: Hoare triple {31968#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,209 INFO L290 TraceCheckUtils]: 155: Hoare triple {31968#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31968#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:11,209 INFO L290 TraceCheckUtils]: 156: Hoare triple {31968#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,210 INFO L290 TraceCheckUtils]: 157: Hoare triple {31996#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,210 INFO L272 TraceCheckUtils]: 158: Hoare triple {31996#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,210 INFO L290 TraceCheckUtils]: 159: Hoare triple {31996#(<= ~counter~0 17)} ~cond := #in~cond; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,211 INFO L290 TraceCheckUtils]: 160: Hoare triple {31996#(<= ~counter~0 17)} assume !(0 == ~cond); {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,211 INFO L290 TraceCheckUtils]: 161: Hoare triple {31996#(<= ~counter~0 17)} assume true; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,212 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {31996#(<= ~counter~0 17)} {31996#(<= ~counter~0 17)} #71#return; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,212 INFO L290 TraceCheckUtils]: 163: Hoare triple {31996#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,212 INFO L290 TraceCheckUtils]: 164: Hoare triple {31996#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31996#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:11,212 INFO L290 TraceCheckUtils]: 165: Hoare triple {31996#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32024#(<= |main_#t~post6| 17)} is VALID [2022-04-28 14:13:11,213 INFO L290 TraceCheckUtils]: 166: Hoare triple {32024#(<= |main_#t~post6| 17)} assume !(#t~post6 < 50);havoc #t~post6; {31507#false} is VALID [2022-04-28 14:13:11,213 INFO L272 TraceCheckUtils]: 167: Hoare triple {31507#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {31507#false} is VALID [2022-04-28 14:13:11,213 INFO L290 TraceCheckUtils]: 168: Hoare triple {31507#false} ~cond := #in~cond; {31507#false} is VALID [2022-04-28 14:13:11,213 INFO L290 TraceCheckUtils]: 169: Hoare triple {31507#false} assume 0 == ~cond; {31507#false} is VALID [2022-04-28 14:13:11,213 INFO L290 TraceCheckUtils]: 170: Hoare triple {31507#false} assume !false; {31507#false} is VALID [2022-04-28 14:13:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 34 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:13:11,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:13:12,209 INFO L290 TraceCheckUtils]: 170: Hoare triple {31507#false} assume !false; {31507#false} is VALID [2022-04-28 14:13:12,210 INFO L290 TraceCheckUtils]: 169: Hoare triple {31507#false} assume 0 == ~cond; {31507#false} is VALID [2022-04-28 14:13:12,210 INFO L290 TraceCheckUtils]: 168: Hoare triple {31507#false} ~cond := #in~cond; {31507#false} is VALID [2022-04-28 14:13:12,210 INFO L272 TraceCheckUtils]: 167: Hoare triple {31507#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {31507#false} is VALID [2022-04-28 14:13:12,210 INFO L290 TraceCheckUtils]: 166: Hoare triple {32052#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {31507#false} is VALID [2022-04-28 14:13:12,210 INFO L290 TraceCheckUtils]: 165: Hoare triple {32056#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32052#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:13:12,211 INFO L290 TraceCheckUtils]: 164: Hoare triple {32056#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32056#(< ~counter~0 50)} is VALID [2022-04-28 14:13:12,211 INFO L290 TraceCheckUtils]: 163: Hoare triple {32056#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {32056#(< ~counter~0 50)} is VALID [2022-04-28 14:13:12,211 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {31506#true} {32056#(< ~counter~0 50)} #71#return; {32056#(< ~counter~0 50)} is VALID [2022-04-28 14:13:12,212 INFO L290 TraceCheckUtils]: 161: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,212 INFO L290 TraceCheckUtils]: 160: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,212 INFO L290 TraceCheckUtils]: 159: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,212 INFO L272 TraceCheckUtils]: 158: Hoare triple {32056#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,212 INFO L290 TraceCheckUtils]: 157: Hoare triple {32056#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {32056#(< ~counter~0 50)} is VALID [2022-04-28 14:13:12,213 INFO L290 TraceCheckUtils]: 156: Hoare triple {32084#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32056#(< ~counter~0 50)} is VALID [2022-04-28 14:13:12,213 INFO L290 TraceCheckUtils]: 155: Hoare triple {32084#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32084#(< ~counter~0 49)} is VALID [2022-04-28 14:13:12,213 INFO L290 TraceCheckUtils]: 154: Hoare triple {32084#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {32084#(< ~counter~0 49)} is VALID [2022-04-28 14:13:12,214 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {31506#true} {32084#(< ~counter~0 49)} #71#return; {32084#(< ~counter~0 49)} is VALID [2022-04-28 14:13:12,214 INFO L290 TraceCheckUtils]: 152: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,214 INFO L290 TraceCheckUtils]: 151: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,214 INFO L290 TraceCheckUtils]: 150: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,214 INFO L272 TraceCheckUtils]: 149: Hoare triple {32084#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,214 INFO L290 TraceCheckUtils]: 148: Hoare triple {32084#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {32084#(< ~counter~0 49)} is VALID [2022-04-28 14:13:12,215 INFO L290 TraceCheckUtils]: 147: Hoare triple {32112#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32084#(< ~counter~0 49)} is VALID [2022-04-28 14:13:12,215 INFO L290 TraceCheckUtils]: 146: Hoare triple {32112#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32112#(< ~counter~0 48)} is VALID [2022-04-28 14:13:12,215 INFO L290 TraceCheckUtils]: 145: Hoare triple {32112#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {32112#(< ~counter~0 48)} is VALID [2022-04-28 14:13:12,216 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31506#true} {32112#(< ~counter~0 48)} #71#return; {32112#(< ~counter~0 48)} is VALID [2022-04-28 14:13:12,216 INFO L290 TraceCheckUtils]: 143: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,216 INFO L290 TraceCheckUtils]: 142: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,216 INFO L290 TraceCheckUtils]: 141: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,216 INFO L272 TraceCheckUtils]: 140: Hoare triple {32112#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,216 INFO L290 TraceCheckUtils]: 139: Hoare triple {32112#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {32112#(< ~counter~0 48)} is VALID [2022-04-28 14:13:12,217 INFO L290 TraceCheckUtils]: 138: Hoare triple {32140#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32112#(< ~counter~0 48)} is VALID [2022-04-28 14:13:12,217 INFO L290 TraceCheckUtils]: 137: Hoare triple {32140#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32140#(< ~counter~0 47)} is VALID [2022-04-28 14:13:12,218 INFO L290 TraceCheckUtils]: 136: Hoare triple {32140#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {32140#(< ~counter~0 47)} is VALID [2022-04-28 14:13:12,218 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31506#true} {32140#(< ~counter~0 47)} #71#return; {32140#(< ~counter~0 47)} is VALID [2022-04-28 14:13:12,218 INFO L290 TraceCheckUtils]: 134: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,218 INFO L290 TraceCheckUtils]: 133: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,218 INFO L290 TraceCheckUtils]: 132: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,218 INFO L272 TraceCheckUtils]: 131: Hoare triple {32140#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,219 INFO L290 TraceCheckUtils]: 130: Hoare triple {32140#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {32140#(< ~counter~0 47)} is VALID [2022-04-28 14:13:12,219 INFO L290 TraceCheckUtils]: 129: Hoare triple {32168#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32140#(< ~counter~0 47)} is VALID [2022-04-28 14:13:12,219 INFO L290 TraceCheckUtils]: 128: Hoare triple {32168#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32168#(< ~counter~0 46)} is VALID [2022-04-28 14:13:12,220 INFO L290 TraceCheckUtils]: 127: Hoare triple {32168#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {32168#(< ~counter~0 46)} is VALID [2022-04-28 14:13:12,220 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {31506#true} {32168#(< ~counter~0 46)} #71#return; {32168#(< ~counter~0 46)} is VALID [2022-04-28 14:13:12,220 INFO L290 TraceCheckUtils]: 125: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,220 INFO L290 TraceCheckUtils]: 124: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,220 INFO L290 TraceCheckUtils]: 123: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,220 INFO L272 TraceCheckUtils]: 122: Hoare triple {32168#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,221 INFO L290 TraceCheckUtils]: 121: Hoare triple {32168#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {32168#(< ~counter~0 46)} is VALID [2022-04-28 14:13:12,221 INFO L290 TraceCheckUtils]: 120: Hoare triple {32196#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32168#(< ~counter~0 46)} is VALID [2022-04-28 14:13:12,221 INFO L290 TraceCheckUtils]: 119: Hoare triple {32196#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32196#(< ~counter~0 45)} is VALID [2022-04-28 14:13:12,222 INFO L290 TraceCheckUtils]: 118: Hoare triple {32196#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {32196#(< ~counter~0 45)} is VALID [2022-04-28 14:13:12,222 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {31506#true} {32196#(< ~counter~0 45)} #71#return; {32196#(< ~counter~0 45)} is VALID [2022-04-28 14:13:12,222 INFO L290 TraceCheckUtils]: 116: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,222 INFO L290 TraceCheckUtils]: 115: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,223 INFO L290 TraceCheckUtils]: 114: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,223 INFO L272 TraceCheckUtils]: 113: Hoare triple {32196#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,226 INFO L290 TraceCheckUtils]: 112: Hoare triple {32196#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {32196#(< ~counter~0 45)} is VALID [2022-04-28 14:13:12,226 INFO L290 TraceCheckUtils]: 111: Hoare triple {32224#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32196#(< ~counter~0 45)} is VALID [2022-04-28 14:13:12,227 INFO L290 TraceCheckUtils]: 110: Hoare triple {32224#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32224#(< ~counter~0 44)} is VALID [2022-04-28 14:13:12,227 INFO L290 TraceCheckUtils]: 109: Hoare triple {32224#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {32224#(< ~counter~0 44)} is VALID [2022-04-28 14:13:12,227 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31506#true} {32224#(< ~counter~0 44)} #71#return; {32224#(< ~counter~0 44)} is VALID [2022-04-28 14:13:12,228 INFO L290 TraceCheckUtils]: 107: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,228 INFO L290 TraceCheckUtils]: 106: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,228 INFO L290 TraceCheckUtils]: 105: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,228 INFO L272 TraceCheckUtils]: 104: Hoare triple {32224#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,228 INFO L290 TraceCheckUtils]: 103: Hoare triple {32224#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {32224#(< ~counter~0 44)} is VALID [2022-04-28 14:13:12,228 INFO L290 TraceCheckUtils]: 102: Hoare triple {32252#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32224#(< ~counter~0 44)} is VALID [2022-04-28 14:13:12,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {32252#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32252#(< ~counter~0 43)} is VALID [2022-04-28 14:13:12,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {32252#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {32252#(< ~counter~0 43)} is VALID [2022-04-28 14:13:12,230 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {31506#true} {32252#(< ~counter~0 43)} #71#return; {32252#(< ~counter~0 43)} is VALID [2022-04-28 14:13:12,230 INFO L290 TraceCheckUtils]: 98: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,230 INFO L272 TraceCheckUtils]: 95: Hoare triple {32252#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,230 INFO L290 TraceCheckUtils]: 94: Hoare triple {32252#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {32252#(< ~counter~0 43)} is VALID [2022-04-28 14:13:12,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {32280#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32252#(< ~counter~0 43)} is VALID [2022-04-28 14:13:12,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {32280#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32280#(< ~counter~0 42)} is VALID [2022-04-28 14:13:12,231 INFO L290 TraceCheckUtils]: 91: Hoare triple {32280#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {32280#(< ~counter~0 42)} is VALID [2022-04-28 14:13:12,232 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {31506#true} {32280#(< ~counter~0 42)} #71#return; {32280#(< ~counter~0 42)} is VALID [2022-04-28 14:13:12,232 INFO L290 TraceCheckUtils]: 89: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,232 INFO L290 TraceCheckUtils]: 88: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,232 INFO L290 TraceCheckUtils]: 87: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,232 INFO L272 TraceCheckUtils]: 86: Hoare triple {32280#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,232 INFO L290 TraceCheckUtils]: 85: Hoare triple {32280#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {32280#(< ~counter~0 42)} is VALID [2022-04-28 14:13:12,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {32308#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32280#(< ~counter~0 42)} is VALID [2022-04-28 14:13:12,233 INFO L290 TraceCheckUtils]: 83: Hoare triple {32308#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32308#(< ~counter~0 41)} is VALID [2022-04-28 14:13:12,233 INFO L290 TraceCheckUtils]: 82: Hoare triple {32308#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {32308#(< ~counter~0 41)} is VALID [2022-04-28 14:13:12,234 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31506#true} {32308#(< ~counter~0 41)} #71#return; {32308#(< ~counter~0 41)} is VALID [2022-04-28 14:13:12,234 INFO L290 TraceCheckUtils]: 80: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,234 INFO L272 TraceCheckUtils]: 77: Hoare triple {32308#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {32308#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {32308#(< ~counter~0 41)} is VALID [2022-04-28 14:13:12,235 INFO L290 TraceCheckUtils]: 75: Hoare triple {32336#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32308#(< ~counter~0 41)} is VALID [2022-04-28 14:13:12,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {32336#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32336#(< ~counter~0 40)} is VALID [2022-04-28 14:13:12,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {32336#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {32336#(< ~counter~0 40)} is VALID [2022-04-28 14:13:12,236 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31506#true} {32336#(< ~counter~0 40)} #71#return; {32336#(< ~counter~0 40)} is VALID [2022-04-28 14:13:12,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,236 INFO L272 TraceCheckUtils]: 68: Hoare triple {32336#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {32336#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {32336#(< ~counter~0 40)} is VALID [2022-04-28 14:13:12,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {32364#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32336#(< ~counter~0 40)} is VALID [2022-04-28 14:13:12,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {32364#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32364#(< ~counter~0 39)} is VALID [2022-04-28 14:13:12,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {32364#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {32364#(< ~counter~0 39)} is VALID [2022-04-28 14:13:12,238 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31506#true} {32364#(< ~counter~0 39)} #71#return; {32364#(< ~counter~0 39)} is VALID [2022-04-28 14:13:12,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,238 INFO L272 TraceCheckUtils]: 59: Hoare triple {32364#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {32364#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {32364#(< ~counter~0 39)} is VALID [2022-04-28 14:13:12,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {32392#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32364#(< ~counter~0 39)} is VALID [2022-04-28 14:13:12,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {32392#(< ~counter~0 38)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32392#(< ~counter~0 38)} is VALID [2022-04-28 14:13:12,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {32392#(< ~counter~0 38)} assume !!(0 != ~a~0 && 0 != ~b~0); {32392#(< ~counter~0 38)} is VALID [2022-04-28 14:13:12,240 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31506#true} {32392#(< ~counter~0 38)} #71#return; {32392#(< ~counter~0 38)} is VALID [2022-04-28 14:13:12,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,240 INFO L290 TraceCheckUtils]: 52: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,240 INFO L272 TraceCheckUtils]: 50: Hoare triple {32392#(< ~counter~0 38)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {32392#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {32392#(< ~counter~0 38)} is VALID [2022-04-28 14:13:12,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {32420#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32392#(< ~counter~0 38)} is VALID [2022-04-28 14:13:12,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {32420#(< ~counter~0 37)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32420#(< ~counter~0 37)} is VALID [2022-04-28 14:13:12,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {32420#(< ~counter~0 37)} assume !!(0 != ~a~0 && 0 != ~b~0); {32420#(< ~counter~0 37)} is VALID [2022-04-28 14:13:12,242 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31506#true} {32420#(< ~counter~0 37)} #71#return; {32420#(< ~counter~0 37)} is VALID [2022-04-28 14:13:12,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,243 INFO L272 TraceCheckUtils]: 41: Hoare triple {32420#(< ~counter~0 37)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {32420#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {32420#(< ~counter~0 37)} is VALID [2022-04-28 14:13:12,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {32448#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32420#(< ~counter~0 37)} is VALID [2022-04-28 14:13:12,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {32448#(< ~counter~0 36)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32448#(< ~counter~0 36)} is VALID [2022-04-28 14:13:12,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {32448#(< ~counter~0 36)} assume !!(0 != ~a~0 && 0 != ~b~0); {32448#(< ~counter~0 36)} is VALID [2022-04-28 14:13:12,244 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31506#true} {32448#(< ~counter~0 36)} #71#return; {32448#(< ~counter~0 36)} is VALID [2022-04-28 14:13:12,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,245 INFO L272 TraceCheckUtils]: 32: Hoare triple {32448#(< ~counter~0 36)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {32448#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {32448#(< ~counter~0 36)} is VALID [2022-04-28 14:13:12,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {32476#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32448#(< ~counter~0 36)} is VALID [2022-04-28 14:13:12,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {32476#(< ~counter~0 35)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32476#(< ~counter~0 35)} is VALID [2022-04-28 14:13:12,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {32476#(< ~counter~0 35)} assume !!(0 != ~a~0 && 0 != ~b~0); {32476#(< ~counter~0 35)} is VALID [2022-04-28 14:13:12,248 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31506#true} {32476#(< ~counter~0 35)} #71#return; {32476#(< ~counter~0 35)} is VALID [2022-04-28 14:13:12,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,248 INFO L272 TraceCheckUtils]: 23: Hoare triple {32476#(< ~counter~0 35)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {32476#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {32476#(< ~counter~0 35)} is VALID [2022-04-28 14:13:12,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {32504#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32476#(< ~counter~0 35)} is VALID [2022-04-28 14:13:12,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {32504#(< ~counter~0 34)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32504#(< ~counter~0 34)} is VALID [2022-04-28 14:13:12,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {32504#(< ~counter~0 34)} assume !!(0 != ~a~0 && 0 != ~b~0); {32504#(< ~counter~0 34)} is VALID [2022-04-28 14:13:12,252 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31506#true} {32504#(< ~counter~0 34)} #71#return; {32504#(< ~counter~0 34)} is VALID [2022-04-28 14:13:12,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,252 INFO L272 TraceCheckUtils]: 14: Hoare triple {32504#(< ~counter~0 34)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {32504#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {32504#(< ~counter~0 34)} is VALID [2022-04-28 14:13:12,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {32532#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32504#(< ~counter~0 34)} is VALID [2022-04-28 14:13:12,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {32532#(< ~counter~0 33)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31506#true} {32532#(< ~counter~0 33)} #69#return; {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {31506#true} assume true; {31506#true} is VALID [2022-04-28 14:13:12,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {31506#true} assume !(0 == ~cond); {31506#true} is VALID [2022-04-28 14:13:12,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {31506#true} ~cond := #in~cond; {31506#true} is VALID [2022-04-28 14:13:12,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {32532#(< ~counter~0 33)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31506#true} is VALID [2022-04-28 14:13:12,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {32532#(< ~counter~0 33)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {32532#(< ~counter~0 33)} call #t~ret7 := main(); {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32532#(< ~counter~0 33)} {31506#true} #77#return; {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {32532#(< ~counter~0 33)} assume true; {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {31506#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32532#(< ~counter~0 33)} is VALID [2022-04-28 14:13:12,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {31506#true} call ULTIMATE.init(); {31506#true} is VALID [2022-04-28 14:13:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 34 proven. 714 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 14:13:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:13:12,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399738214] [2022-04-28 14:13:12,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:13:12,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689417767] [2022-04-28 14:13:12,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689417767] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:13:12,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:13:12,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-28 14:13:12,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:13:12,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342163494] [2022-04-28 14:13:12,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342163494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:13:12,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:13:12,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 14:13:12,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216772318] [2022-04-28 14:13:12,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:13:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Word has length 171 [2022-04-28 14:13:12,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:13:12,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:13:12,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:13:12,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 14:13:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:13:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 14:13:12,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 14:13:12,386 INFO L87 Difference]: Start difference. First operand 219 states and 272 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:13:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:13:13,538 INFO L93 Difference]: Finished difference Result 238 states and 295 transitions. [2022-04-28 14:13:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 14:13:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Word has length 171 [2022-04-28 14:13:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:13:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:13:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 281 transitions. [2022-04-28 14:13:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:13:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 281 transitions. [2022-04-28 14:13:13,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 281 transitions. [2022-04-28 14:13:13,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:13:13,794 INFO L225 Difference]: With dead ends: 238 [2022-04-28 14:13:13,794 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 14:13:13,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1371, Invalid=1821, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 14:13:13,795 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 222 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:13:13,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 322 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:13:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 14:13:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-04-28 14:13:14,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:13:14,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:13:14,212 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:13:14,212 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:13:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:13:14,214 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-04-28 14:13:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-28 14:13:14,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:13:14,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:13:14,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 230 states. [2022-04-28 14:13:14,215 INFO L87 Difference]: Start difference. First operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 230 states. [2022-04-28 14:13:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:13:14,218 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-04-28 14:13:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-28 14:13:14,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:13:14,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:13:14,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:13:14,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:13:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 14:13:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2022-04-28 14:13:14,224 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 171 [2022-04-28 14:13:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:13:14,224 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2022-04-28 14:13:14,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 14:13:14,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 286 transitions. [2022-04-28 14:13:51,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 269 inductive. 0 not inductive. 17 times theorem prover too weak to decide inductivity. [2022-04-28 14:13:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-28 14:13:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-28 14:13:51,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:13:51,241 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:13:51,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 14:13:51,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 14:13:51,442 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:13:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:13:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1754232326, now seen corresponding path program 35 times [2022-04-28 14:13:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:13:51,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754668137] [2022-04-28 14:13:57,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:13:57,493 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:13:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1754232326, now seen corresponding path program 36 times [2022-04-28 14:13:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:13:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46104179] [2022-04-28 14:13:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:13:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:13:57,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:13:57,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280819040] [2022-04-28 14:13:57,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:13:57,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:13:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:13:57,529 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:13:57,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 14:13:57,793 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 14:13:57,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:13:57,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 14:13:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:13:57,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:13:58,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {34001#true} call ULTIMATE.init(); {34001#true} is VALID [2022-04-28 14:13:58,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {34009#(<= ~counter~0 0)} assume true; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34009#(<= ~counter~0 0)} {34001#true} #77#return; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {34009#(<= ~counter~0 0)} call #t~ret7 := main(); {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {34009#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {34009#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {34009#(<= ~counter~0 0)} ~cond := #in~cond; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {34009#(<= ~counter~0 0)} assume !(0 == ~cond); {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {34009#(<= ~counter~0 0)} assume true; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34009#(<= ~counter~0 0)} {34009#(<= ~counter~0 0)} #69#return; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {34009#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {34009#(<= ~counter~0 0)} is VALID [2022-04-28 14:13:58,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {34009#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {34043#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,799 INFO L272 TraceCheckUtils]: 14: Hoare triple {34043#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {34043#(<= ~counter~0 1)} ~cond := #in~cond; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {34043#(<= ~counter~0 1)} assume !(0 == ~cond); {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {34043#(<= ~counter~0 1)} assume true; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,801 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {34043#(<= ~counter~0 1)} {34043#(<= ~counter~0 1)} #71#return; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {34043#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {34043#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34043#(<= ~counter~0 1)} is VALID [2022-04-28 14:13:58,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {34043#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {34071#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,802 INFO L272 TraceCheckUtils]: 23: Hoare triple {34071#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {34071#(<= ~counter~0 2)} ~cond := #in~cond; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {34071#(<= ~counter~0 2)} assume !(0 == ~cond); {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {34071#(<= ~counter~0 2)} assume true; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,804 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34071#(<= ~counter~0 2)} {34071#(<= ~counter~0 2)} #71#return; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {34071#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {34071#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34071#(<= ~counter~0 2)} is VALID [2022-04-28 14:13:58,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {34071#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {34099#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,806 INFO L272 TraceCheckUtils]: 32: Hoare triple {34099#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {34099#(<= ~counter~0 3)} ~cond := #in~cond; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {34099#(<= ~counter~0 3)} assume !(0 == ~cond); {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {34099#(<= ~counter~0 3)} assume true; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,807 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {34099#(<= ~counter~0 3)} {34099#(<= ~counter~0 3)} #71#return; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {34099#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {34099#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34099#(<= ~counter~0 3)} is VALID [2022-04-28 14:13:58,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {34099#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {34127#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,809 INFO L272 TraceCheckUtils]: 41: Hoare triple {34127#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {34127#(<= ~counter~0 4)} ~cond := #in~cond; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {34127#(<= ~counter~0 4)} assume !(0 == ~cond); {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {34127#(<= ~counter~0 4)} assume true; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,810 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34127#(<= ~counter~0 4)} {34127#(<= ~counter~0 4)} #71#return; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {34127#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {34127#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34127#(<= ~counter~0 4)} is VALID [2022-04-28 14:13:58,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {34127#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {34155#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,812 INFO L272 TraceCheckUtils]: 50: Hoare triple {34155#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {34155#(<= ~counter~0 5)} ~cond := #in~cond; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {34155#(<= ~counter~0 5)} assume !(0 == ~cond); {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {34155#(<= ~counter~0 5)} assume true; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,813 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {34155#(<= ~counter~0 5)} {34155#(<= ~counter~0 5)} #71#return; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {34155#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {34155#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34155#(<= ~counter~0 5)} is VALID [2022-04-28 14:13:58,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {34155#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {34183#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,815 INFO L272 TraceCheckUtils]: 59: Hoare triple {34183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,816 INFO L290 TraceCheckUtils]: 60: Hoare triple {34183#(<= ~counter~0 6)} ~cond := #in~cond; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {34183#(<= ~counter~0 6)} assume !(0 == ~cond); {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {34183#(<= ~counter~0 6)} assume true; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,817 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34183#(<= ~counter~0 6)} {34183#(<= ~counter~0 6)} #71#return; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {34183#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {34183#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34183#(<= ~counter~0 6)} is VALID [2022-04-28 14:13:58,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {34183#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {34211#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,819 INFO L272 TraceCheckUtils]: 68: Hoare triple {34211#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {34211#(<= ~counter~0 7)} ~cond := #in~cond; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {34211#(<= ~counter~0 7)} assume !(0 == ~cond); {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {34211#(<= ~counter~0 7)} assume true; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,820 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {34211#(<= ~counter~0 7)} {34211#(<= ~counter~0 7)} #71#return; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {34211#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {34211#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34211#(<= ~counter~0 7)} is VALID [2022-04-28 14:13:58,821 INFO L290 TraceCheckUtils]: 75: Hoare triple {34211#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,821 INFO L290 TraceCheckUtils]: 76: Hoare triple {34239#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,822 INFO L272 TraceCheckUtils]: 77: Hoare triple {34239#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {34239#(<= ~counter~0 8)} ~cond := #in~cond; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {34239#(<= ~counter~0 8)} assume !(0 == ~cond); {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {34239#(<= ~counter~0 8)} assume true; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,823 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34239#(<= ~counter~0 8)} {34239#(<= ~counter~0 8)} #71#return; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {34239#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,824 INFO L290 TraceCheckUtils]: 83: Hoare triple {34239#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34239#(<= ~counter~0 8)} is VALID [2022-04-28 14:13:58,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {34239#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {34267#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,825 INFO L272 TraceCheckUtils]: 86: Hoare triple {34267#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {34267#(<= ~counter~0 9)} ~cond := #in~cond; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,826 INFO L290 TraceCheckUtils]: 88: Hoare triple {34267#(<= ~counter~0 9)} assume !(0 == ~cond); {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,826 INFO L290 TraceCheckUtils]: 89: Hoare triple {34267#(<= ~counter~0 9)} assume true; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,826 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {34267#(<= ~counter~0 9)} {34267#(<= ~counter~0 9)} #71#return; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,827 INFO L290 TraceCheckUtils]: 91: Hoare triple {34267#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {34267#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34267#(<= ~counter~0 9)} is VALID [2022-04-28 14:13:58,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {34267#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {34295#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,828 INFO L272 TraceCheckUtils]: 95: Hoare triple {34295#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,829 INFO L290 TraceCheckUtils]: 96: Hoare triple {34295#(<= ~counter~0 10)} ~cond := #in~cond; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,829 INFO L290 TraceCheckUtils]: 97: Hoare triple {34295#(<= ~counter~0 10)} assume !(0 == ~cond); {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,829 INFO L290 TraceCheckUtils]: 98: Hoare triple {34295#(<= ~counter~0 10)} assume true; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,830 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34295#(<= ~counter~0 10)} {34295#(<= ~counter~0 10)} #71#return; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,830 INFO L290 TraceCheckUtils]: 100: Hoare triple {34295#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,830 INFO L290 TraceCheckUtils]: 101: Hoare triple {34295#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34295#(<= ~counter~0 10)} is VALID [2022-04-28 14:13:58,831 INFO L290 TraceCheckUtils]: 102: Hoare triple {34295#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,831 INFO L290 TraceCheckUtils]: 103: Hoare triple {34323#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,832 INFO L272 TraceCheckUtils]: 104: Hoare triple {34323#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,832 INFO L290 TraceCheckUtils]: 105: Hoare triple {34323#(<= ~counter~0 11)} ~cond := #in~cond; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,832 INFO L290 TraceCheckUtils]: 106: Hoare triple {34323#(<= ~counter~0 11)} assume !(0 == ~cond); {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,832 INFO L290 TraceCheckUtils]: 107: Hoare triple {34323#(<= ~counter~0 11)} assume true; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,833 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34323#(<= ~counter~0 11)} {34323#(<= ~counter~0 11)} #71#return; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,833 INFO L290 TraceCheckUtils]: 109: Hoare triple {34323#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,833 INFO L290 TraceCheckUtils]: 110: Hoare triple {34323#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34323#(<= ~counter~0 11)} is VALID [2022-04-28 14:13:58,834 INFO L290 TraceCheckUtils]: 111: Hoare triple {34323#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {34351#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,835 INFO L272 TraceCheckUtils]: 113: Hoare triple {34351#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,835 INFO L290 TraceCheckUtils]: 114: Hoare triple {34351#(<= ~counter~0 12)} ~cond := #in~cond; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,835 INFO L290 TraceCheckUtils]: 115: Hoare triple {34351#(<= ~counter~0 12)} assume !(0 == ~cond); {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,836 INFO L290 TraceCheckUtils]: 116: Hoare triple {34351#(<= ~counter~0 12)} assume true; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,836 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {34351#(<= ~counter~0 12)} {34351#(<= ~counter~0 12)} #71#return; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,836 INFO L290 TraceCheckUtils]: 118: Hoare triple {34351#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,837 INFO L290 TraceCheckUtils]: 119: Hoare triple {34351#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34351#(<= ~counter~0 12)} is VALID [2022-04-28 14:13:58,837 INFO L290 TraceCheckUtils]: 120: Hoare triple {34351#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,837 INFO L290 TraceCheckUtils]: 121: Hoare triple {34379#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,838 INFO L272 TraceCheckUtils]: 122: Hoare triple {34379#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,838 INFO L290 TraceCheckUtils]: 123: Hoare triple {34379#(<= ~counter~0 13)} ~cond := #in~cond; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,838 INFO L290 TraceCheckUtils]: 124: Hoare triple {34379#(<= ~counter~0 13)} assume !(0 == ~cond); {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,839 INFO L290 TraceCheckUtils]: 125: Hoare triple {34379#(<= ~counter~0 13)} assume true; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,839 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {34379#(<= ~counter~0 13)} {34379#(<= ~counter~0 13)} #71#return; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,840 INFO L290 TraceCheckUtils]: 127: Hoare triple {34379#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,840 INFO L290 TraceCheckUtils]: 128: Hoare triple {34379#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34379#(<= ~counter~0 13)} is VALID [2022-04-28 14:13:58,840 INFO L290 TraceCheckUtils]: 129: Hoare triple {34379#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,841 INFO L290 TraceCheckUtils]: 130: Hoare triple {34407#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,841 INFO L272 TraceCheckUtils]: 131: Hoare triple {34407#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,841 INFO L290 TraceCheckUtils]: 132: Hoare triple {34407#(<= ~counter~0 14)} ~cond := #in~cond; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,842 INFO L290 TraceCheckUtils]: 133: Hoare triple {34407#(<= ~counter~0 14)} assume !(0 == ~cond); {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,842 INFO L290 TraceCheckUtils]: 134: Hoare triple {34407#(<= ~counter~0 14)} assume true; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,842 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34407#(<= ~counter~0 14)} {34407#(<= ~counter~0 14)} #71#return; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,843 INFO L290 TraceCheckUtils]: 136: Hoare triple {34407#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,843 INFO L290 TraceCheckUtils]: 137: Hoare triple {34407#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34407#(<= ~counter~0 14)} is VALID [2022-04-28 14:13:58,844 INFO L290 TraceCheckUtils]: 138: Hoare triple {34407#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,844 INFO L290 TraceCheckUtils]: 139: Hoare triple {34435#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,844 INFO L272 TraceCheckUtils]: 140: Hoare triple {34435#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,845 INFO L290 TraceCheckUtils]: 141: Hoare triple {34435#(<= ~counter~0 15)} ~cond := #in~cond; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,845 INFO L290 TraceCheckUtils]: 142: Hoare triple {34435#(<= ~counter~0 15)} assume !(0 == ~cond); {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,845 INFO L290 TraceCheckUtils]: 143: Hoare triple {34435#(<= ~counter~0 15)} assume true; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,846 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {34435#(<= ~counter~0 15)} {34435#(<= ~counter~0 15)} #71#return; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,846 INFO L290 TraceCheckUtils]: 145: Hoare triple {34435#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,846 INFO L290 TraceCheckUtils]: 146: Hoare triple {34435#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34435#(<= ~counter~0 15)} is VALID [2022-04-28 14:13:58,847 INFO L290 TraceCheckUtils]: 147: Hoare triple {34435#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,847 INFO L290 TraceCheckUtils]: 148: Hoare triple {34463#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,848 INFO L272 TraceCheckUtils]: 149: Hoare triple {34463#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,848 INFO L290 TraceCheckUtils]: 150: Hoare triple {34463#(<= ~counter~0 16)} ~cond := #in~cond; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,848 INFO L290 TraceCheckUtils]: 151: Hoare triple {34463#(<= ~counter~0 16)} assume !(0 == ~cond); {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,848 INFO L290 TraceCheckUtils]: 152: Hoare triple {34463#(<= ~counter~0 16)} assume true; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,849 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {34463#(<= ~counter~0 16)} {34463#(<= ~counter~0 16)} #71#return; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,849 INFO L290 TraceCheckUtils]: 154: Hoare triple {34463#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,849 INFO L290 TraceCheckUtils]: 155: Hoare triple {34463#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34463#(<= ~counter~0 16)} is VALID [2022-04-28 14:13:58,850 INFO L290 TraceCheckUtils]: 156: Hoare triple {34463#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,850 INFO L290 TraceCheckUtils]: 157: Hoare triple {34491#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,851 INFO L272 TraceCheckUtils]: 158: Hoare triple {34491#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,851 INFO L290 TraceCheckUtils]: 159: Hoare triple {34491#(<= ~counter~0 17)} ~cond := #in~cond; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,851 INFO L290 TraceCheckUtils]: 160: Hoare triple {34491#(<= ~counter~0 17)} assume !(0 == ~cond); {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,851 INFO L290 TraceCheckUtils]: 161: Hoare triple {34491#(<= ~counter~0 17)} assume true; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,852 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {34491#(<= ~counter~0 17)} {34491#(<= ~counter~0 17)} #71#return; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,852 INFO L290 TraceCheckUtils]: 163: Hoare triple {34491#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,853 INFO L290 TraceCheckUtils]: 164: Hoare triple {34491#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34491#(<= ~counter~0 17)} is VALID [2022-04-28 14:13:58,853 INFO L290 TraceCheckUtils]: 165: Hoare triple {34491#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,853 INFO L290 TraceCheckUtils]: 166: Hoare triple {34519#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,854 INFO L272 TraceCheckUtils]: 167: Hoare triple {34519#(<= ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,854 INFO L290 TraceCheckUtils]: 168: Hoare triple {34519#(<= ~counter~0 18)} ~cond := #in~cond; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,854 INFO L290 TraceCheckUtils]: 169: Hoare triple {34519#(<= ~counter~0 18)} assume !(0 == ~cond); {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,855 INFO L290 TraceCheckUtils]: 170: Hoare triple {34519#(<= ~counter~0 18)} assume true; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,855 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34519#(<= ~counter~0 18)} {34519#(<= ~counter~0 18)} #71#return; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,856 INFO L290 TraceCheckUtils]: 172: Hoare triple {34519#(<= ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,856 INFO L290 TraceCheckUtils]: 173: Hoare triple {34519#(<= ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34519#(<= ~counter~0 18)} is VALID [2022-04-28 14:13:58,856 INFO L290 TraceCheckUtils]: 174: Hoare triple {34519#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34547#(<= |main_#t~post6| 18)} is VALID [2022-04-28 14:13:58,856 INFO L290 TraceCheckUtils]: 175: Hoare triple {34547#(<= |main_#t~post6| 18)} assume !(#t~post6 < 50);havoc #t~post6; {34002#false} is VALID [2022-04-28 14:13:58,856 INFO L272 TraceCheckUtils]: 176: Hoare triple {34002#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {34002#false} is VALID [2022-04-28 14:13:58,857 INFO L290 TraceCheckUtils]: 177: Hoare triple {34002#false} ~cond := #in~cond; {34002#false} is VALID [2022-04-28 14:13:58,857 INFO L290 TraceCheckUtils]: 178: Hoare triple {34002#false} assume 0 == ~cond; {34002#false} is VALID [2022-04-28 14:13:58,857 INFO L290 TraceCheckUtils]: 179: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-28 14:13:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 36 proven. 1413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:13:58,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:13:59,975 INFO L290 TraceCheckUtils]: 179: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-28 14:13:59,975 INFO L290 TraceCheckUtils]: 178: Hoare triple {34002#false} assume 0 == ~cond; {34002#false} is VALID [2022-04-28 14:13:59,975 INFO L290 TraceCheckUtils]: 177: Hoare triple {34002#false} ~cond := #in~cond; {34002#false} is VALID [2022-04-28 14:13:59,975 INFO L272 TraceCheckUtils]: 176: Hoare triple {34002#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {34002#false} is VALID [2022-04-28 14:13:59,975 INFO L290 TraceCheckUtils]: 175: Hoare triple {34575#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {34002#false} is VALID [2022-04-28 14:13:59,976 INFO L290 TraceCheckUtils]: 174: Hoare triple {34579#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34575#(< |main_#t~post6| 50)} is VALID [2022-04-28 14:13:59,976 INFO L290 TraceCheckUtils]: 173: Hoare triple {34579#(< ~counter~0 50)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34579#(< ~counter~0 50)} is VALID [2022-04-28 14:13:59,976 INFO L290 TraceCheckUtils]: 172: Hoare triple {34579#(< ~counter~0 50)} assume !!(0 != ~a~0 && 0 != ~b~0); {34579#(< ~counter~0 50)} is VALID [2022-04-28 14:13:59,977 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34001#true} {34579#(< ~counter~0 50)} #71#return; {34579#(< ~counter~0 50)} is VALID [2022-04-28 14:13:59,977 INFO L290 TraceCheckUtils]: 170: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,977 INFO L290 TraceCheckUtils]: 169: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,977 INFO L290 TraceCheckUtils]: 168: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,977 INFO L272 TraceCheckUtils]: 167: Hoare triple {34579#(< ~counter~0 50)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,977 INFO L290 TraceCheckUtils]: 166: Hoare triple {34579#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {34579#(< ~counter~0 50)} is VALID [2022-04-28 14:13:59,978 INFO L290 TraceCheckUtils]: 165: Hoare triple {34607#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34579#(< ~counter~0 50)} is VALID [2022-04-28 14:13:59,978 INFO L290 TraceCheckUtils]: 164: Hoare triple {34607#(< ~counter~0 49)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34607#(< ~counter~0 49)} is VALID [2022-04-28 14:13:59,979 INFO L290 TraceCheckUtils]: 163: Hoare triple {34607#(< ~counter~0 49)} assume !!(0 != ~a~0 && 0 != ~b~0); {34607#(< ~counter~0 49)} is VALID [2022-04-28 14:13:59,979 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {34001#true} {34607#(< ~counter~0 49)} #71#return; {34607#(< ~counter~0 49)} is VALID [2022-04-28 14:13:59,979 INFO L290 TraceCheckUtils]: 161: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,979 INFO L290 TraceCheckUtils]: 160: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,979 INFO L290 TraceCheckUtils]: 159: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,979 INFO L272 TraceCheckUtils]: 158: Hoare triple {34607#(< ~counter~0 49)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,980 INFO L290 TraceCheckUtils]: 157: Hoare triple {34607#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {34607#(< ~counter~0 49)} is VALID [2022-04-28 14:13:59,980 INFO L290 TraceCheckUtils]: 156: Hoare triple {34635#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34607#(< ~counter~0 49)} is VALID [2022-04-28 14:13:59,980 INFO L290 TraceCheckUtils]: 155: Hoare triple {34635#(< ~counter~0 48)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34635#(< ~counter~0 48)} is VALID [2022-04-28 14:13:59,981 INFO L290 TraceCheckUtils]: 154: Hoare triple {34635#(< ~counter~0 48)} assume !!(0 != ~a~0 && 0 != ~b~0); {34635#(< ~counter~0 48)} is VALID [2022-04-28 14:13:59,981 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {34001#true} {34635#(< ~counter~0 48)} #71#return; {34635#(< ~counter~0 48)} is VALID [2022-04-28 14:13:59,981 INFO L290 TraceCheckUtils]: 152: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,981 INFO L290 TraceCheckUtils]: 151: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,981 INFO L290 TraceCheckUtils]: 150: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,981 INFO L272 TraceCheckUtils]: 149: Hoare triple {34635#(< ~counter~0 48)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,982 INFO L290 TraceCheckUtils]: 148: Hoare triple {34635#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {34635#(< ~counter~0 48)} is VALID [2022-04-28 14:13:59,982 INFO L290 TraceCheckUtils]: 147: Hoare triple {34663#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34635#(< ~counter~0 48)} is VALID [2022-04-28 14:13:59,982 INFO L290 TraceCheckUtils]: 146: Hoare triple {34663#(< ~counter~0 47)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34663#(< ~counter~0 47)} is VALID [2022-04-28 14:13:59,983 INFO L290 TraceCheckUtils]: 145: Hoare triple {34663#(< ~counter~0 47)} assume !!(0 != ~a~0 && 0 != ~b~0); {34663#(< ~counter~0 47)} is VALID [2022-04-28 14:13:59,983 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {34001#true} {34663#(< ~counter~0 47)} #71#return; {34663#(< ~counter~0 47)} is VALID [2022-04-28 14:13:59,983 INFO L290 TraceCheckUtils]: 143: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,983 INFO L290 TraceCheckUtils]: 142: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,984 INFO L290 TraceCheckUtils]: 141: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,984 INFO L272 TraceCheckUtils]: 140: Hoare triple {34663#(< ~counter~0 47)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,984 INFO L290 TraceCheckUtils]: 139: Hoare triple {34663#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {34663#(< ~counter~0 47)} is VALID [2022-04-28 14:13:59,984 INFO L290 TraceCheckUtils]: 138: Hoare triple {34691#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34663#(< ~counter~0 47)} is VALID [2022-04-28 14:13:59,985 INFO L290 TraceCheckUtils]: 137: Hoare triple {34691#(< ~counter~0 46)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34691#(< ~counter~0 46)} is VALID [2022-04-28 14:13:59,985 INFO L290 TraceCheckUtils]: 136: Hoare triple {34691#(< ~counter~0 46)} assume !!(0 != ~a~0 && 0 != ~b~0); {34691#(< ~counter~0 46)} is VALID [2022-04-28 14:13:59,985 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34001#true} {34691#(< ~counter~0 46)} #71#return; {34691#(< ~counter~0 46)} is VALID [2022-04-28 14:13:59,986 INFO L290 TraceCheckUtils]: 134: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,986 INFO L290 TraceCheckUtils]: 133: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,986 INFO L290 TraceCheckUtils]: 132: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,986 INFO L272 TraceCheckUtils]: 131: Hoare triple {34691#(< ~counter~0 46)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,986 INFO L290 TraceCheckUtils]: 130: Hoare triple {34691#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {34691#(< ~counter~0 46)} is VALID [2022-04-28 14:13:59,986 INFO L290 TraceCheckUtils]: 129: Hoare triple {34719#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34691#(< ~counter~0 46)} is VALID [2022-04-28 14:13:59,987 INFO L290 TraceCheckUtils]: 128: Hoare triple {34719#(< ~counter~0 45)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34719#(< ~counter~0 45)} is VALID [2022-04-28 14:13:59,987 INFO L290 TraceCheckUtils]: 127: Hoare triple {34719#(< ~counter~0 45)} assume !!(0 != ~a~0 && 0 != ~b~0); {34719#(< ~counter~0 45)} is VALID [2022-04-28 14:13:59,988 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {34001#true} {34719#(< ~counter~0 45)} #71#return; {34719#(< ~counter~0 45)} is VALID [2022-04-28 14:13:59,988 INFO L290 TraceCheckUtils]: 125: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,988 INFO L290 TraceCheckUtils]: 124: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,988 INFO L290 TraceCheckUtils]: 123: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,988 INFO L272 TraceCheckUtils]: 122: Hoare triple {34719#(< ~counter~0 45)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,988 INFO L290 TraceCheckUtils]: 121: Hoare triple {34719#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {34719#(< ~counter~0 45)} is VALID [2022-04-28 14:13:59,989 INFO L290 TraceCheckUtils]: 120: Hoare triple {34747#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34719#(< ~counter~0 45)} is VALID [2022-04-28 14:13:59,989 INFO L290 TraceCheckUtils]: 119: Hoare triple {34747#(< ~counter~0 44)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34747#(< ~counter~0 44)} is VALID [2022-04-28 14:13:59,989 INFO L290 TraceCheckUtils]: 118: Hoare triple {34747#(< ~counter~0 44)} assume !!(0 != ~a~0 && 0 != ~b~0); {34747#(< ~counter~0 44)} is VALID [2022-04-28 14:13:59,990 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {34001#true} {34747#(< ~counter~0 44)} #71#return; {34747#(< ~counter~0 44)} is VALID [2022-04-28 14:13:59,990 INFO L290 TraceCheckUtils]: 116: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,990 INFO L290 TraceCheckUtils]: 115: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,990 INFO L272 TraceCheckUtils]: 113: Hoare triple {34747#(< ~counter~0 44)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,990 INFO L290 TraceCheckUtils]: 112: Hoare triple {34747#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {34747#(< ~counter~0 44)} is VALID [2022-04-28 14:13:59,991 INFO L290 TraceCheckUtils]: 111: Hoare triple {34775#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34747#(< ~counter~0 44)} is VALID [2022-04-28 14:13:59,991 INFO L290 TraceCheckUtils]: 110: Hoare triple {34775#(< ~counter~0 43)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34775#(< ~counter~0 43)} is VALID [2022-04-28 14:13:59,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {34775#(< ~counter~0 43)} assume !!(0 != ~a~0 && 0 != ~b~0); {34775#(< ~counter~0 43)} is VALID [2022-04-28 14:13:59,992 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34001#true} {34775#(< ~counter~0 43)} #71#return; {34775#(< ~counter~0 43)} is VALID [2022-04-28 14:13:59,992 INFO L290 TraceCheckUtils]: 107: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,992 INFO L290 TraceCheckUtils]: 106: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,992 INFO L290 TraceCheckUtils]: 105: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,992 INFO L272 TraceCheckUtils]: 104: Hoare triple {34775#(< ~counter~0 43)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {34775#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {34775#(< ~counter~0 43)} is VALID [2022-04-28 14:13:59,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {34803#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34775#(< ~counter~0 43)} is VALID [2022-04-28 14:13:59,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {34803#(< ~counter~0 42)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34803#(< ~counter~0 42)} is VALID [2022-04-28 14:13:59,994 INFO L290 TraceCheckUtils]: 100: Hoare triple {34803#(< ~counter~0 42)} assume !!(0 != ~a~0 && 0 != ~b~0); {34803#(< ~counter~0 42)} is VALID [2022-04-28 14:13:59,994 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34001#true} {34803#(< ~counter~0 42)} #71#return; {34803#(< ~counter~0 42)} is VALID [2022-04-28 14:13:59,994 INFO L290 TraceCheckUtils]: 98: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,994 INFO L290 TraceCheckUtils]: 97: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,994 INFO L290 TraceCheckUtils]: 96: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,994 INFO L272 TraceCheckUtils]: 95: Hoare triple {34803#(< ~counter~0 42)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {34803#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {34803#(< ~counter~0 42)} is VALID [2022-04-28 14:13:59,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {34831#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34803#(< ~counter~0 42)} is VALID [2022-04-28 14:13:59,998 INFO L290 TraceCheckUtils]: 92: Hoare triple {34831#(< ~counter~0 41)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34831#(< ~counter~0 41)} is VALID [2022-04-28 14:13:59,998 INFO L290 TraceCheckUtils]: 91: Hoare triple {34831#(< ~counter~0 41)} assume !!(0 != ~a~0 && 0 != ~b~0); {34831#(< ~counter~0 41)} is VALID [2022-04-28 14:13:59,999 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {34001#true} {34831#(< ~counter~0 41)} #71#return; {34831#(< ~counter~0 41)} is VALID [2022-04-28 14:13:59,999 INFO L290 TraceCheckUtils]: 89: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:13:59,999 INFO L290 TraceCheckUtils]: 88: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:13:59,999 INFO L290 TraceCheckUtils]: 87: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:13:59,999 INFO L272 TraceCheckUtils]: 86: Hoare triple {34831#(< ~counter~0 41)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:13:59,999 INFO L290 TraceCheckUtils]: 85: Hoare triple {34831#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {34831#(< ~counter~0 41)} is VALID [2022-04-28 14:14:00,000 INFO L290 TraceCheckUtils]: 84: Hoare triple {34859#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34831#(< ~counter~0 41)} is VALID [2022-04-28 14:14:00,000 INFO L290 TraceCheckUtils]: 83: Hoare triple {34859#(< ~counter~0 40)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34859#(< ~counter~0 40)} is VALID [2022-04-28 14:14:00,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {34859#(< ~counter~0 40)} assume !!(0 != ~a~0 && 0 != ~b~0); {34859#(< ~counter~0 40)} is VALID [2022-04-28 14:14:00,001 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34001#true} {34859#(< ~counter~0 40)} #71#return; {34859#(< ~counter~0 40)} is VALID [2022-04-28 14:14:00,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,001 INFO L272 TraceCheckUtils]: 77: Hoare triple {34859#(< ~counter~0 40)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {34859#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {34859#(< ~counter~0 40)} is VALID [2022-04-28 14:14:00,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {34887#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34859#(< ~counter~0 40)} is VALID [2022-04-28 14:14:00,002 INFO L290 TraceCheckUtils]: 74: Hoare triple {34887#(< ~counter~0 39)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34887#(< ~counter~0 39)} is VALID [2022-04-28 14:14:00,003 INFO L290 TraceCheckUtils]: 73: Hoare triple {34887#(< ~counter~0 39)} assume !!(0 != ~a~0 && 0 != ~b~0); {34887#(< ~counter~0 39)} is VALID [2022-04-28 14:14:00,004 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {34001#true} {34887#(< ~counter~0 39)} #71#return; {34887#(< ~counter~0 39)} is VALID [2022-04-28 14:14:00,004 INFO L290 TraceCheckUtils]: 71: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,004 INFO L272 TraceCheckUtils]: 68: Hoare triple {34887#(< ~counter~0 39)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {34887#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {34887#(< ~counter~0 39)} is VALID [2022-04-28 14:14:00,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {34915#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34887#(< ~counter~0 39)} is VALID [2022-04-28 14:14:00,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {34915#(< ~counter~0 38)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34915#(< ~counter~0 38)} is VALID [2022-04-28 14:14:00,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {34915#(< ~counter~0 38)} assume !!(0 != ~a~0 && 0 != ~b~0); {34915#(< ~counter~0 38)} is VALID [2022-04-28 14:14:00,006 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34001#true} {34915#(< ~counter~0 38)} #71#return; {34915#(< ~counter~0 38)} is VALID [2022-04-28 14:14:00,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,006 INFO L272 TraceCheckUtils]: 59: Hoare triple {34915#(< ~counter~0 38)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {34915#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {34915#(< ~counter~0 38)} is VALID [2022-04-28 14:14:00,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {34943#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34915#(< ~counter~0 38)} is VALID [2022-04-28 14:14:00,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {34943#(< ~counter~0 37)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34943#(< ~counter~0 37)} is VALID [2022-04-28 14:14:00,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {34943#(< ~counter~0 37)} assume !!(0 != ~a~0 && 0 != ~b~0); {34943#(< ~counter~0 37)} is VALID [2022-04-28 14:14:00,008 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {34001#true} {34943#(< ~counter~0 37)} #71#return; {34943#(< ~counter~0 37)} is VALID [2022-04-28 14:14:00,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,008 INFO L272 TraceCheckUtils]: 50: Hoare triple {34943#(< ~counter~0 37)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {34943#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {34943#(< ~counter~0 37)} is VALID [2022-04-28 14:14:00,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {34971#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34943#(< ~counter~0 37)} is VALID [2022-04-28 14:14:00,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {34971#(< ~counter~0 36)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34971#(< ~counter~0 36)} is VALID [2022-04-28 14:14:00,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {34971#(< ~counter~0 36)} assume !!(0 != ~a~0 && 0 != ~b~0); {34971#(< ~counter~0 36)} is VALID [2022-04-28 14:14:00,010 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34001#true} {34971#(< ~counter~0 36)} #71#return; {34971#(< ~counter~0 36)} is VALID [2022-04-28 14:14:00,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,010 INFO L272 TraceCheckUtils]: 41: Hoare triple {34971#(< ~counter~0 36)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {34971#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {34971#(< ~counter~0 36)} is VALID [2022-04-28 14:14:00,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {34999#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34971#(< ~counter~0 36)} is VALID [2022-04-28 14:14:00,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {34999#(< ~counter~0 35)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34999#(< ~counter~0 35)} is VALID [2022-04-28 14:14:00,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {34999#(< ~counter~0 35)} assume !!(0 != ~a~0 && 0 != ~b~0); {34999#(< ~counter~0 35)} is VALID [2022-04-28 14:14:00,012 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {34001#true} {34999#(< ~counter~0 35)} #71#return; {34999#(< ~counter~0 35)} is VALID [2022-04-28 14:14:00,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,012 INFO L272 TraceCheckUtils]: 32: Hoare triple {34999#(< ~counter~0 35)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {34999#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {34999#(< ~counter~0 35)} is VALID [2022-04-28 14:14:00,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {35027#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34999#(< ~counter~0 35)} is VALID [2022-04-28 14:14:00,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {35027#(< ~counter~0 34)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {35027#(< ~counter~0 34)} is VALID [2022-04-28 14:14:00,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {35027#(< ~counter~0 34)} assume !!(0 != ~a~0 && 0 != ~b~0); {35027#(< ~counter~0 34)} is VALID [2022-04-28 14:14:00,014 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34001#true} {35027#(< ~counter~0 34)} #71#return; {35027#(< ~counter~0 34)} is VALID [2022-04-28 14:14:00,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,015 INFO L272 TraceCheckUtils]: 23: Hoare triple {35027#(< ~counter~0 34)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {35027#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {35027#(< ~counter~0 34)} is VALID [2022-04-28 14:14:00,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {35055#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35027#(< ~counter~0 34)} is VALID [2022-04-28 14:14:00,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {35055#(< ~counter~0 33)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {35055#(< ~counter~0 33)} is VALID [2022-04-28 14:14:00,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {35055#(< ~counter~0 33)} assume !!(0 != ~a~0 && 0 != ~b~0); {35055#(< ~counter~0 33)} is VALID [2022-04-28 14:14:00,016 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {34001#true} {35055#(< ~counter~0 33)} #71#return; {35055#(< ~counter~0 33)} is VALID [2022-04-28 14:14:00,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,017 INFO L272 TraceCheckUtils]: 14: Hoare triple {35055#(< ~counter~0 33)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {35055#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {35055#(< ~counter~0 33)} is VALID [2022-04-28 14:14:00,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {35083#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35055#(< ~counter~0 33)} is VALID [2022-04-28 14:14:00,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {35083#(< ~counter~0 32)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34001#true} {35083#(< ~counter~0 32)} #69#return; {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 14:14:00,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {34001#true} assume !(0 == ~cond); {34001#true} is VALID [2022-04-28 14:14:00,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {34001#true} ~cond := #in~cond; {34001#true} is VALID [2022-04-28 14:14:00,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {35083#(< ~counter~0 32)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34001#true} is VALID [2022-04-28 14:14:00,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {35083#(< ~counter~0 32)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {35083#(< ~counter~0 32)} call #t~ret7 := main(); {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35083#(< ~counter~0 32)} {34001#true} #77#return; {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {35083#(< ~counter~0 32)} assume true; {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35083#(< ~counter~0 32)} is VALID [2022-04-28 14:14:00,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {34001#true} call ULTIMATE.init(); {34001#true} is VALID [2022-04-28 14:14:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 36 proven. 801 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-28 14:14:00,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:14:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46104179] [2022-04-28 14:14:00,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:14:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280819040] [2022-04-28 14:14:00,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280819040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:14:00,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:14:00,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-28 14:14:00,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:14:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754668137] [2022-04-28 14:14:00,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754668137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:14:00,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:14:00,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 14:14:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635918755] [2022-04-28 14:14:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:14:00,022 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Word has length 180 [2022-04-28 14:14:00,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:14:00,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:14:00,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:14:00,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 14:14:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:14:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 14:14:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 14:14:00,160 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:14:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:14:01,334 INFO L93 Difference]: Finished difference Result 249 states and 309 transitions. [2022-04-28 14:14:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 14:14:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Word has length 180 [2022-04-28 14:14:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:14:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:14:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 295 transitions. [2022-04-28 14:14:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:14:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 295 transitions. [2022-04-28 14:14:01,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 295 transitions. [2022-04-28 14:14:01,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:14:01,668 INFO L225 Difference]: With dead ends: 249 [2022-04-28 14:14:01,668 INFO L226 Difference]: Without dead ends: 241 [2022-04-28 14:14:01,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1523, Invalid=2017, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 14:14:01,669 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 224 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:14:01,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 318 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:14:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-28 14:14:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-04-28 14:14:02,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:14:02,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:14:02,091 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:14:02,092 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:14:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:14:02,095 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2022-04-28 14:14:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-28 14:14:02,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:14:02,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:14:02,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 241 states. [2022-04-28 14:14:02,096 INFO L87 Difference]: Start difference. First operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 241 states. [2022-04-28 14:14:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:14:02,100 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2022-04-28 14:14:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-28 14:14:02,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:14:02,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:14:02,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:14:02,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:14:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 14:14:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 300 transitions. [2022-04-28 14:14:02,105 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 300 transitions. Word has length 180 [2022-04-28 14:14:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:14:02,105 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 300 transitions. [2022-04-28 14:14:02,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 14:14:02,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 241 states and 300 transitions.