/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:53:37,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:53:37,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:53:37,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:53:37,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:53:37,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:53:37,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:53:37,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:53:37,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:53:37,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:53:37,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:53:37,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:53:37,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:53:37,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:53:37,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:53:37,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:53:37,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:53:37,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:53:37,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:53:37,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:53:37,815 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:53:37,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:53:37,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:53:37,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:53:37,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:53:37,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:53:37,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:53:37,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:53:37,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:53:37,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:53:37,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:53:37,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:53:37,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:53:37,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:53:37,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:53:37,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:53:37,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:53:37,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:53:37,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:53:37,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:53:37,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:53:37,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:53:37,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:53:37,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:53:37,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:53:37,852 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:53:37,852 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:53:37,853 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:53:37,853 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:53:37,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:53:37,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:53:37,853 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:53:37,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:53:37,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:53:37,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:53:37,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:53:37,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:53:37,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:53:37,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:53:37,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:53:37,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:53:37,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:53:37,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:53:37,857 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:53:37,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:53:37,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:53:37,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:53:38,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:53:38,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:53:38,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:53:38,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:53:38,076 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:53:38,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2022-04-27 12:53:38,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8e76111/9518d88142f649ae9e416737634a7061/FLAG53531f1e7 [2022-04-27 12:53:38,415 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:53:38,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2022-04-27 12:53:38,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8e76111/9518d88142f649ae9e416737634a7061/FLAG53531f1e7 [2022-04-27 12:53:38,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8e76111/9518d88142f649ae9e416737634a7061 [2022-04-27 12:53:38,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:53:38,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:53:38,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:53:38,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:53:38,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:53:38,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:53:38" (1/1) ... [2022-04-27 12:53:38,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1738a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:38, skipping insertion in model container [2022-04-27 12:53:38,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:53:38" (1/1) ... [2022-04-27 12:53:38,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:53:38,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:53:39,029 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/egcd2-ll_unwindbound20.c[490,503] [2022-04-27 12:53:39,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:53:39,080 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:53:39,094 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/egcd2-ll_unwindbound20.c[490,503] [2022-04-27 12:53:39,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:53:39,139 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:53:39,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39 WrapperNode [2022-04-27 12:53:39,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:53:39,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:53:39,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:53:39,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:53:39,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:53:39,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:53:39,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:53:39,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:53:39,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (1/1) ... [2022-04-27 12:53:39,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:53:39,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:39,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:53:39,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:53:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:53:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:53:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:53:39,311 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:53:39,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:53:39,553 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:53:39,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:53:39,560 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:53:39,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:53:39 BoogieIcfgContainer [2022-04-27 12:53:39,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:53:39,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:53:39,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:53:39,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:53:39,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:53:38" (1/3) ... [2022-04-27 12:53:39,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16473b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:53:39, skipping insertion in model container [2022-04-27 12:53:39,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:39" (2/3) ... [2022-04-27 12:53:39,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16473b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:53:39, skipping insertion in model container [2022-04-27 12:53:39,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:53:39" (3/3) ... [2022-04-27 12:53:39,569 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound20.c [2022-04-27 12:53:39,579 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:53:39,579 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:53:39,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:53:39,629 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@279bc57f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bce2fed [2022-04-27 12:53:39,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:53:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:53:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:53:39,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:39,642 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:39,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-27 12:53:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:39,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563680049] [2022-04-27 12:53:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:53:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:39,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:53:39,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:53:39,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:53:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:53:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:39,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:53:39,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:53:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:39,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:53:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:53:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:39,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:53:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:53:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:39,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:53:39,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:53:39,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:53:39,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:53:39,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:53:39,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-27 12:53:39,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {42#true} is VALID [2022-04-27 12:53:39,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:39,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:53:39,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:39,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:53:39,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-27 12:53:39,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:39,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,912 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:53:39,913 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:39,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:39,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:39,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:39,914 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:53:39,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:53:39,914 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-27 12:53:39,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:53:39,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:53:39,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:53:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563680049] [2022-04-27 12:53:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563680049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:53:39,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:53:39,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:53:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579053163] [2022-04-27 12:53:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:39,927 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:53:39,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:39,932 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:39,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:39,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:53:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:53:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:53:40,006 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:40,191 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-27 12:53:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:53:40,191 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:53:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:40,192 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:53:40,199 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:53:40,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-27 12:53:40,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:40,331 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:53:40,331 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:53:40,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:53:40,335 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:40,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:53:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:53:40,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:40,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,357 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,358 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:40,362 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:53:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:53:40,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:40,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:40,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:53:40,364 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:53:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:40,368 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:53:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:53:40,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:40,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:40,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:40,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-27 12:53:40,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-27 12:53:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:40,372 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-27 12:53:40,373 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 12:53:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:53:40,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:40,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:40,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:53:40,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-27 12:53:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:40,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896991582] [2022-04-27 12:53:40,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:40,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:40,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287352993] [2022-04-27 12:53:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:40,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:40,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:40,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:40,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:53:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:40,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:53:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:40,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:40,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2022-04-27 12:53:40,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#(<= ~counter~0 0)} {292#true} #98#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#(<= ~counter~0 0)} call #t~ret8 := main(); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #78#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,664 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #80#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {300#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,665 INFO L272 TraceCheckUtils]: 17: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,666 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #82#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,667 INFO L272 TraceCheckUtils]: 22: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,669 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #84#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:40,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {379#(<= |main_#t~post6| 0)} is VALID [2022-04-27 12:53:40,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {379#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {293#false} is VALID [2022-04-27 12:53:40,670 INFO L272 TraceCheckUtils]: 29: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {293#false} is VALID [2022-04-27 12:53:40,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2022-04-27 12:53:40,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2022-04-27 12:53:40,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-27 12:53:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:40,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:53:40,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:40,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896991582] [2022-04-27 12:53:40,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:40,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287352993] [2022-04-27 12:53:40,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287352993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:53:40,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:53:40,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:53:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77436473] [2022-04-27 12:53:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:40,677 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:53:40,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:40,677 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:40,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:53:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:40,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:53:40,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:53:40,700 INFO L87 Difference]: Start difference. First operand 34 states and 45 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:40,797 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 12:53:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:53:40,797 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:53:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:40,798 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:53:40,803 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:53:40,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-27 12:53:40,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:40,866 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:53:40,866 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:53:40,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-27 12:53:40,868 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:40,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:53:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:53:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:53:40,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:40,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,884 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,885 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:40,891 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:53:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:53:40,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:40,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:40,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:53:40,897 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:53:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:40,900 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:53:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:53:40,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:40,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:40,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:40,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-27 12:53:40,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-27 12:53:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:40,903 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-27 12:53:40,903 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:53:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:53:40,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:40,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:40,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:41,120 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-27 12:53:41,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:41,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-27 12:53:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:41,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825143885] [2022-04-27 12:53:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:41,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:41,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898221928] [2022-04-27 12:53:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:41,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:41,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:41,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:41,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:53:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:41,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:41,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:41,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:53:41,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:53:41,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:53:41,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:53:41,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {587#true} is VALID [2022-04-27 12:53:41,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:41,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:41,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:53:41,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:41,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:41,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:41,319 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:41,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,320 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:41,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:41,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,323 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,323 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:41,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:41,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,323 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:53:41,325 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:53:41,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:53:41,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:53:41,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:53:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:41,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:41,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:53:41,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:53:41,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:53:41,515 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:53:41,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:53:41,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,528 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:41,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:41,528 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,529 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:41,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:41,529 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:41,531 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:41,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:41,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:41,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:53:41,532 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:53:41,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:41,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:41,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:41,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {587#true} is VALID [2022-04-27 12:53:41,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:53:41,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:53:41,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:41,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:53:41,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:53:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:41,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825143885] [2022-04-27 12:53:41,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:41,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898221928] [2022-04-27 12:53:41,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898221928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:53:41,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:53:41,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 12:53:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630605227] [2022-04-27 12:53:41,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:53:41,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:53:41,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:41,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:41,557 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-27 12:53:41,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:53:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:53:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:53:41,558 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:41,797 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 12:53:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:53:41,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:53:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:53:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:53:41,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 12:53:41,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:41,873 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:53:41,873 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 12:53:41,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:53:41,876 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:41,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 12:53:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-27 12:53:41,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:41,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:41,901 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:41,901 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:41,903 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:53:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:53:41,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:41,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:41,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:53:41,904 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:53:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:41,906 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:53:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:53:41,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:41,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:41,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:41,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-27 12:53:41,908 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-27 12:53:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:41,908 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-27 12:53:41,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-27 12:53:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:53:41,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:41,909 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:41,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:42,128 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-27 12:53:42,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-27 12:53:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:42,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110962951] [2022-04-27 12:53:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:42,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976959018] [2022-04-27 12:53:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:42,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:42,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:42,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:53:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:42,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:53:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:42,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:42,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:53:42,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:53:42,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:53:42,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:53:42,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1027#true} is VALID [2022-04-27 12:53:42,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:53:42,376 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:42,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:42,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:42,378 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} {1027#true} #80#return; {1079#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:42,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:42,378 INFO L272 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,379 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #82#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:42,379 INFO L272 TraceCheckUtils]: 22: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,380 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #84#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:42,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {1083#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:42,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:42,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:53:42,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:53:42,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 20);havoc #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:53:42,382 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:42,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:42,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:53:42,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:53:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:42,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:42,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:53:42,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:53:42,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:42,526 INFO L272 TraceCheckUtils]: 32: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:42,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:53:42,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:53:42,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {1027#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:53:42,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {1027#true} assume !!(#t~post6 < 20);havoc #t~post6; {1027#true} is VALID [2022-04-27 12:53:42,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {1027#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1027#true} is VALID [2022-04-27 12:53:42,528 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1027#true} #84#return; {1027#true} is VALID [2022-04-27 12:53:42,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,528 INFO L272 TraceCheckUtils]: 22: Hoare triple {1027#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1027#true} #82#return; {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L272 TraceCheckUtils]: 17: Hoare triple {1027#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {1027#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1027#true} {1027#true} #80#return; {1027#true} is VALID [2022-04-27 12:53:42,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:42,530 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:53:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:42,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110962951] [2022-04-27 12:53:42,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:42,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976959018] [2022-04-27 12:53:42,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976959018] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:53:42,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:53:42,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 12:53:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249077756] [2022-04-27 12:53:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:53:42,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:42,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:42,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:42,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:53:42,565 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:42,739 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:53:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:42,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:53:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:53:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:53:42,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:53:42,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:42,789 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:53:42,789 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 12:53:42,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:53:42,790 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:42,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 12:53:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 12:53:42,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:42,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:42,804 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:42,805 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:42,806 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:53:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:53:42,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:42,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:42,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:53:42,807 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:53:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:42,808 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:53:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:53:42,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:42,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:42,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:42,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 12:53:42,810 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-27 12:53:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:42,811 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 12:53:42,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:53:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:53:42,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:42,811 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:42,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:43,012 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-27 12:53:43,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-27 12:53:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:43,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892708445] [2022-04-27 12:53:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:43,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400374263] [2022-04-27 12:53:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:43,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:43,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:43,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:43,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:53:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:43,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:53:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:43,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:43,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2022-04-27 12:53:43,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1468#(<= ~counter~0 0)} {1460#true} #98#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {1468#(<= ~counter~0 0)} call #t~ret8 := main(); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #78#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,254 INFO L272 TraceCheckUtils]: 11: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,255 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #80#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {1468#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,256 INFO L272 TraceCheckUtils]: 17: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,258 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #82#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,258 INFO L272 TraceCheckUtils]: 22: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,260 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #84#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:43,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {1468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:53:43,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {1547#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:53:43,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {1547#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:53:43,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {1547#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1557#(<= |main_#t~post7| 1)} is VALID [2022-04-27 12:53:43,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {1557#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1461#false} is VALID [2022-04-27 12:53:43,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1461#false} is VALID [2022-04-27 12:53:43,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1461#false} is VALID [2022-04-27 12:53:43,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(#t~post6 < 20);havoc #t~post6; {1461#false} is VALID [2022-04-27 12:53:43,271 INFO L272 TraceCheckUtils]: 35: Hoare triple {1461#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1461#false} is VALID [2022-04-27 12:53:43,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2022-04-27 12:53:43,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume 0 == ~cond; {1461#false} is VALID [2022-04-27 12:53:43,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-27 12:53:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:43,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:53:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892708445] [2022-04-27 12:53:43,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400374263] [2022-04-27 12:53:43,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400374263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:53:43,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:53:43,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:53:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492855030] [2022-04-27 12:53:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:53:43,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:43,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:43,296 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-27 12:53:43,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:43,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:43,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:43,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:53:43,297 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:43,420 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:53:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:53:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:53:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:53:43,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 12:53:43,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:43,478 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:53:43,478 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 12:53:43,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:53:43,479 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:43,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:53:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 12:53:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 12:53:43,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:43,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:43,497 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:43,498 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:43,500 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:53:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:53:43,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:43,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:43,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:53:43,501 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:53:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:43,502 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:53:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:53:43,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:43,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:43,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:43,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-27 12:53:43,505 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-27 12:53:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:43,505 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-27 12:53:43,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:53:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 12:53:43,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:43,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:43,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:43,723 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-27 12:53:43,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-27 12:53:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978394334] [2022-04-27 12:53:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:43,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:43,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861599826] [2022-04-27 12:53:43,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:43,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:43,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:43,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:43,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:53:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:43,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:53:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:43,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:44,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:53:44,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:53:44,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:53:44,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:44,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:44,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:44,072 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} {1828#true} #80#return; {1880#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:44,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {1880#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,072 INFO L272 TraceCheckUtils]: 17: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,073 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,073 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,079 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,082 INFO L272 TraceCheckUtils]: 32: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,083 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:44,084 INFO L272 TraceCheckUtils]: 37: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:44,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:44,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:53:44,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:53:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:44,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:44,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:53:44,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:53:44,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:44,300 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:44,300 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,301 INFO L272 TraceCheckUtils]: 32: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,304 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,304 INFO L272 TraceCheckUtils]: 22: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,305 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,305 INFO L272 TraceCheckUtils]: 17: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:44,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1828#true} {1828#true} #80#return; {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:44,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:53:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:44,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978394334] [2022-04-27 12:53:44,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861599826] [2022-04-27 12:53:44,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861599826] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:53:44,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:53:44,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:53:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507637841] [2022-04-27 12:53:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:44,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 12:53:44,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:44,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:53:44,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:44,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:53:44,335 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:53:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:44,607 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 12:53:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 12:53:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:53:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:53:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:44,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:53:44,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:44,656 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:53:44,656 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 12:53:44,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:53:44,656 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:44,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 12:53:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 12:53:44,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:44,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:44,680 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:44,680 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:44,682 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:53:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:53:44,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:44,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:44,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:53:44,683 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:53:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:44,684 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:53:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:53:44,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:44,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:44,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:44,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 12:53:44,686 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-27 12:53:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:44,687 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 12:53:44,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:53:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 12:53:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 12:53:44,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:44,687 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:44,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:44,902 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-27 12:53:44,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-27 12:53:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:44,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906870267] [2022-04-27 12:53:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:44,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18407211] [2022-04-27 12:53:44,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:44,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:44,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:53:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:44,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:53:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:44,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:45,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:53:45,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:53:45,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:53:45,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:53:45,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2359#true} is VALID [2022-04-27 12:53:45,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:45,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:45,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:45,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} {2359#true} #78#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:53:45,231 INFO L272 TraceCheckUtils]: 11: Hoare triple {2396#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2396#(<= 1 main_~x~0)} #80#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:53:45,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,233 INFO L272 TraceCheckUtils]: 17: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,233 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,234 INFO L272 TraceCheckUtils]: 22: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,234 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,236 INFO L272 TraceCheckUtils]: 32: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,241 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,241 INFO L272 TraceCheckUtils]: 37: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,242 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:45,243 INFO L272 TraceCheckUtils]: 42: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:45,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:45,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:53:45,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:53:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:53:45,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:45,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:53:45,454 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:53:45,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:45,456 INFO L272 TraceCheckUtils]: 42: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:45,456 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,457 INFO L272 TraceCheckUtils]: 37: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,468 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,468 INFO L272 TraceCheckUtils]: 32: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,470 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,471 INFO L272 TraceCheckUtils]: 22: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,471 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:45,472 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2359#true} #80#return; {2359#true} is VALID [2022-04-27 12:53:45,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L272 TraceCheckUtils]: 11: Hoare triple {2359#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} #78#return; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:53:45,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:45,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:53:45,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:53:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:53:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:45,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906870267] [2022-04-27 12:53:45,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:45,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18407211] [2022-04-27 12:53:45,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18407211] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:53:45,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:53:45,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:53:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900386378] [2022-04-27 12:53:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:45,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:53:45,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:45,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:45,503 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-27 12:53:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:53:45,505 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:45,738 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 12:53:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:53:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:45,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:53:45,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:45,783 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:53:45,783 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 12:53:45,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:53:45,784 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:45,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:53:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 12:53:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 12:53:45,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:45,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:45,821 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:45,822 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:45,823 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:53:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:53:45,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:45,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:45,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:53:45,824 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:53:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:45,826 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:53:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:53:45,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:45,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:45,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:45,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-27 12:53:45,828 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-27 12:53:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:45,828 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-27 12:53:45,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 12:53:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 12:53:45,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:45,829 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:45,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-27 12:53:46,043 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-27 12:53:46,044 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-27 12:53:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:46,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913755464] [2022-04-27 12:53:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:46,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:46,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109419545] [2022-04-27 12:53:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:46,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:46,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:46,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:53:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:46,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:53:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:46,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:52,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #98#return; {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret8 := main(); {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {2938#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L272 TraceCheckUtils]: 6: Hoare triple {2938#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:52,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:52,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:52,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2938#true} {2938#true} #78#return; {2938#true} is VALID [2022-04-27 12:53:52,441 INFO L272 TraceCheckUtils]: 11: Hoare triple {2938#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {2938#true} ~cond := #in~cond; {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:52,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:52,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:52,449 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} {2938#true} #80#return; {2990#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:52,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {2990#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,450 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:52,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:52,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:52,450 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #82#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,451 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:52,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:52,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:52,451 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,454 INFO L272 TraceCheckUtils]: 32: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:52,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:52,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:52,455 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #86#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,457 INFO L272 TraceCheckUtils]: 37: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:52,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:52,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:52,459 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #88#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,459 INFO L272 TraceCheckUtils]: 42: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:52,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:52,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:52,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:52,460 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #90#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:52,461 INFO L272 TraceCheckUtils]: 47: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:52,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:52,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {3094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2939#false} is VALID [2022-04-27 12:53:52,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-04-27 12:53:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 12:53:52,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:43,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913755464] [2022-04-27 12:54:43,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:43,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109419545] [2022-04-27 12:54:43,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109419545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:54:43,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:54:43,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 12:54:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359173088] [2022-04-27 12:54:43,539 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:54:43,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:43,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:43,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:54:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:54:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:54:43,573 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:45,388 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 12:54:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:54:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:54:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 12:54:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 12:54:45,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 12:54:45,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:45,453 INFO L225 Difference]: With dead ends: 65 [2022-04-27 12:54:45,453 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 12:54:45,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:54:45,454 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:45,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:54:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 12:54:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 12:54:45,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:45,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:45,478 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:45,479 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:45,481 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 12:54:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 12:54:45,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:45,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:45,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 12:54:45,482 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 12:54:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:45,483 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 12:54:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 12:54:45,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:45,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:45,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:45,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-27 12:54:45,486 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-27 12:54:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:45,486 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-27 12:54:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-27 12:54:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 12:54:45,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:45,487 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:45,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:45,704 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-27 12:54:45,705 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-27 12:54:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:45,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294029949] [2022-04-27 12:54:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:45,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:45,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278133244] [2022-04-27 12:54:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:45,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:45,718 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:45,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:54:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:45,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:54:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:45,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:46,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-27 12:54:46,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3442#(<= ~counter~0 0)} {3434#true} #98#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {3442#(<= ~counter~0 0)} call #t~ret8 := main(); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {3442#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #78#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,039 INFO L272 TraceCheckUtils]: 11: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #80#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {3442#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,041 INFO L272 TraceCheckUtils]: 17: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,052 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #82#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,052 INFO L272 TraceCheckUtils]: 22: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,054 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #84#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:46,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {3442#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:46,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {3521#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:46,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {3521#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:46,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {3521#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {3531#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,056 INFO L272 TraceCheckUtils]: 32: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,057 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #86#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,058 INFO L272 TraceCheckUtils]: 37: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,059 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #88#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,060 INFO L272 TraceCheckUtils]: 42: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,062 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #90#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,063 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,064 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #92#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {3531#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {3531#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:46,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {3531#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3604#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:54:46,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {3604#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3435#false} is VALID [2022-04-27 12:54:46,066 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-27 12:54:46,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-27 12:54:46,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-27 12:54:46,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-27 12:54:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:54:46,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:46,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-27 12:54:46,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-27 12:54:46,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-27 12:54:46,316 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-27 12:54:46,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {3632#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3435#false} is VALID [2022-04-27 12:54:46,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {3636#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3632#(< |main_#t~post6| 20)} is VALID [2022-04-27 12:54:46,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {3636#(< ~counter~0 20)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {3636#(< ~counter~0 20)} assume !(~c~0 >= ~b~0); {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,318 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3434#true} {3636#(< ~counter~0 20)} #92#return; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,318 INFO L272 TraceCheckUtils]: 47: Hoare triple {3636#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,319 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3434#true} {3636#(< ~counter~0 20)} #90#return; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,319 INFO L272 TraceCheckUtils]: 42: Hoare triple {3636#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,320 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3434#true} {3636#(< ~counter~0 20)} #88#return; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,320 INFO L272 TraceCheckUtils]: 37: Hoare triple {3636#(< ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,320 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3434#true} {3636#(< ~counter~0 20)} #86#return; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,321 INFO L272 TraceCheckUtils]: 32: Hoare triple {3636#(< ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {3636#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {3709#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3636#(< ~counter~0 20)} is VALID [2022-04-27 12:54:46,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {3709#(< ~counter~0 19)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3709#(< ~counter~0 19)} is VALID [2022-04-27 12:54:46,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3709#(< ~counter~0 19)} is VALID [2022-04-27 12:54:46,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {3719#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3709#(< ~counter~0 19)} is VALID [2022-04-27 12:54:46,328 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3434#true} {3719#(< ~counter~0 18)} #84#return; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,328 INFO L272 TraceCheckUtils]: 22: Hoare triple {3719#(< ~counter~0 18)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,329 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3434#true} {3719#(< ~counter~0 18)} #82#return; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,329 INFO L272 TraceCheckUtils]: 17: Hoare triple {3719#(< ~counter~0 18)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {3719#(< ~counter~0 18)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3434#true} {3719#(< ~counter~0 18)} #80#return; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,330 INFO L272 TraceCheckUtils]: 11: Hoare triple {3719#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3434#true} {3719#(< ~counter~0 18)} #78#return; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:54:46,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:54:46,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:54:46,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {3719#(< ~counter~0 18)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:54:46,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {3719#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {3719#(< ~counter~0 18)} call #t~ret8 := main(); {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3719#(< ~counter~0 18)} {3434#true} #98#return; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {3719#(< ~counter~0 18)} assume true; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3719#(< ~counter~0 18)} is VALID [2022-04-27 12:54:46,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-27 12:54:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:54:46,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:46,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294029949] [2022-04-27 12:54:46,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:46,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278133244] [2022-04-27 12:54:46,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278133244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:54:46,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:54:46,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:54:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093282310] [2022-04-27 12:54:46,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-27 12:54:46,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:46,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:46,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:46,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:54:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:54:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:54:46,414 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:46,845 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2022-04-27 12:54:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:54:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-27 12:54:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-04-27 12:54:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-04-27 12:54:46,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 157 transitions. [2022-04-27 12:54:46,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:46,966 INFO L225 Difference]: With dead ends: 215 [2022-04-27 12:54:46,966 INFO L226 Difference]: Without dead ends: 207 [2022-04-27 12:54:46,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:54:46,967 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:46,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 209 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:54:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-27 12:54:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-04-27 12:54:47,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:47,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:54:47,081 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:54:47,082 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:54:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:47,087 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-27 12:54:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2022-04-27 12:54:47,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:47,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:47,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-27 12:54:47,088 INFO L87 Difference]: Start difference. First operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-27 12:54:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:47,092 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-27 12:54:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2022-04-27 12:54:47,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:47,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:47,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:47,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:54:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-04-27 12:54:47,098 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-04-27 12:54:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:47,098 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-04-27 12:54:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-04-27 12:54:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 12:54:47,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:47,099 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:47,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:47,311 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-27 12:54:47,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-27 12:54:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530470599] [2022-04-27 12:54:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:47,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811578698] [2022-04-27 12:54:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:47,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:47,331 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:47,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:54:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:47,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:54:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:47,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:47,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2022-04-27 12:54:47,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4818#true} is VALID [2022-04-27 12:54:47,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4818#true} {4818#true} #98#return; {4818#true} is VALID [2022-04-27 12:54:47,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#true} call #t~ret8 := main(); {4818#true} is VALID [2022-04-27 12:54:47,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {4818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {4818#true} is VALID [2022-04-27 12:54:47,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {4818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#true} ~cond := #in~cond; {4844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:54:47,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {4844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:47,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:47,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} {4818#true} #78#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 12:54:47,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {4855#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4818#true} {4855#(<= 1 main_~x~0)} #80#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 12:54:47,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {4855#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,578 INFO L272 TraceCheckUtils]: 17: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,579 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #82#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,580 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #84#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {4874#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(#t~post6 < 20);havoc #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {4914#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {4914#(<= 1 main_~c~0)} assume !!(#t~post7 < 20);havoc #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,581 INFO L272 TraceCheckUtils]: 32: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,582 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #86#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,582 INFO L272 TraceCheckUtils]: 37: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,583 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #88#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,583 INFO L272 TraceCheckUtils]: 42: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,584 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #90#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,584 INFO L272 TraceCheckUtils]: 47: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,585 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #92#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {4914#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {4914#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:47,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:47,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:47,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4819#false} is VALID [2022-04-27 12:54:47,587 INFO L272 TraceCheckUtils]: 57: Hoare triple {4819#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4819#false} is VALID [2022-04-27 12:54:47,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {4819#false} ~cond := #in~cond; {4819#false} is VALID [2022-04-27 12:54:47,587 INFO L290 TraceCheckUtils]: 59: Hoare triple {4819#false} assume 0 == ~cond; {4819#false} is VALID [2022-04-27 12:54:47,587 INFO L290 TraceCheckUtils]: 60: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2022-04-27 12:54:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:54:47,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:47,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2022-04-27 12:54:47,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {4819#false} assume 0 == ~cond; {4819#false} is VALID [2022-04-27 12:54:47,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {4819#false} ~cond := #in~cond; {4819#false} is VALID [2022-04-27 12:54:47,834 INFO L272 TraceCheckUtils]: 57: Hoare triple {4819#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4819#false} is VALID [2022-04-27 12:54:47,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4819#false} is VALID [2022-04-27 12:54:47,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:47,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:47,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {4914#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:47,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {4914#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,836 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #92#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,837 INFO L272 TraceCheckUtils]: 47: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,837 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #90#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,838 INFO L272 TraceCheckUtils]: 42: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,838 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #88#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,839 INFO L272 TraceCheckUtils]: 37: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,839 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #86#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,839 INFO L272 TraceCheckUtils]: 32: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {4914#(<= 1 main_~c~0)} assume !!(#t~post7 < 20);havoc #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {4914#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 12:54:47,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(#t~post6 < 20);havoc #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {4874#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,841 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #84#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,842 INFO L272 TraceCheckUtils]: 22: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,842 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #82#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,842 INFO L272 TraceCheckUtils]: 17: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {4855#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 12:54:47,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4818#true} {4855#(<= 1 main_~x~0)} #80#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 12:54:47,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 12:54:47,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 12:54:47,843 INFO L272 TraceCheckUtils]: 11: Hoare triple {4855#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} {4818#true} #78#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 12:54:47,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:47,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {5168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:47,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#true} ~cond := #in~cond; {5168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:54:47,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {4818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 12:54:47,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {4818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {4818#true} is VALID [2022-04-27 12:54:47,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#true} call #t~ret8 := main(); {4818#true} is VALID [2022-04-27 12:54:47,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4818#true} {4818#true} #98#return; {4818#true} is VALID [2022-04-27 12:54:47,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 12:54:47,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4818#true} is VALID [2022-04-27 12:54:47,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2022-04-27 12:54:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:54:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:47,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530470599] [2022-04-27 12:54:47,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:47,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811578698] [2022-04-27 12:54:47,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811578698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:54:47,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:54:47,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 12:54:47,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742921135] [2022-04-27 12:54:47,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-27 12:54:47,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:47,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:54:47,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:47,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:54:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:54:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:54:47,883 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:54:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:48,642 INFO L93 Difference]: Finished difference Result 283 states and 368 transitions. [2022-04-27 12:54:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:54:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-27 12:54:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:54:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 12:54:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:54:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 12:54:48,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-27 12:54:48,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:48,770 INFO L225 Difference]: With dead ends: 283 [2022-04-27 12:54:48,770 INFO L226 Difference]: Without dead ends: 263 [2022-04-27 12:54:48,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:54:48,771 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:48,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 262 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:54:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-27 12:54:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-04-27 12:54:48,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:48,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:48,945 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:48,946 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:48,951 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-27 12:54:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2022-04-27 12:54:48,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:48,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:48,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 263 states. [2022-04-27 12:54:48,952 INFO L87 Difference]: Start difference. First operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 263 states. [2022-04-27 12:54:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:48,957 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-27 12:54:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2022-04-27 12:54:48,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:48,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:48,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:48,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-04-27 12:54:48,963 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-04-27 12:54:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:48,964 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-04-27 12:54:48,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:54:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-04-27 12:54:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 12:54:48,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:48,964 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:48,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:49,182 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-27 12:54:49,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 428029148, now seen corresponding path program 1 times [2022-04-27 12:54:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:49,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926277374] [2022-04-27 12:54:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:49,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:49,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723832572] [2022-04-27 12:54:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:49,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:49,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:49,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 12:54:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:49,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:54:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:49,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:49,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {6497#true} call ULTIMATE.init(); {6497#true} is VALID [2022-04-27 12:54:49,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {6497#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6505#(<= ~counter~0 0)} {6497#true} #98#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {6505#(<= ~counter~0 0)} call #t~ret8 := main(); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {6505#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #78#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,471 INFO L272 TraceCheckUtils]: 11: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,472 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #80#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {6505#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,473 INFO L272 TraceCheckUtils]: 17: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,474 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #82#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,475 INFO L272 TraceCheckUtils]: 22: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,476 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #84#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:49,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {6505#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6584#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:49,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {6584#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6584#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:49,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {6584#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6584#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:49,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {6584#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {6594#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,479 INFO L272 TraceCheckUtils]: 32: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #86#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,481 INFO L272 TraceCheckUtils]: 37: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,483 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #88#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,483 INFO L272 TraceCheckUtils]: 42: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,485 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #90#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,486 INFO L272 TraceCheckUtils]: 47: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,487 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #92#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {6594#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 12:54:49,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {6594#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6664#(<= |main_#t~post7| 2)} is VALID [2022-04-27 12:54:49,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {6664#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {6498#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {6498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {6498#false} assume !!(#t~post6 < 20);havoc #t~post6; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {6498#false} assume !(0 != ~b~0); {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L272 TraceCheckUtils]: 59: Hoare triple {6498#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {6498#false} ~cond := #in~cond; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {6498#false} assume 0 == ~cond; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {6498#false} assume !false; {6498#false} is VALID [2022-04-27 12:54:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:54:49,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:49,697 INFO L290 TraceCheckUtils]: 62: Hoare triple {6498#false} assume !false; {6498#false} is VALID [2022-04-27 12:54:49,697 INFO L290 TraceCheckUtils]: 61: Hoare triple {6498#false} assume 0 == ~cond; {6498#false} is VALID [2022-04-27 12:54:49,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {6498#false} ~cond := #in~cond; {6498#false} is VALID [2022-04-27 12:54:49,697 INFO L272 TraceCheckUtils]: 59: Hoare triple {6498#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6498#false} is VALID [2022-04-27 12:54:49,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {6498#false} assume !(0 != ~b~0); {6498#false} is VALID [2022-04-27 12:54:49,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {6498#false} assume !!(#t~post6 < 20);havoc #t~post6; {6498#false} is VALID [2022-04-27 12:54:49,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {6498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6498#false} is VALID [2022-04-27 12:54:49,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {6498#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6498#false} is VALID [2022-04-27 12:54:49,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {6716#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {6498#false} is VALID [2022-04-27 12:54:49,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {6720#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6716#(< |main_#t~post7| 20)} is VALID [2022-04-27 12:54:49,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {6720#(< ~counter~0 20)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,708 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6497#true} {6720#(< ~counter~0 20)} #92#return; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,708 INFO L272 TraceCheckUtils]: 47: Hoare triple {6720#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,709 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6497#true} {6720#(< ~counter~0 20)} #90#return; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,709 INFO L272 TraceCheckUtils]: 42: Hoare triple {6720#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,709 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6497#true} {6720#(< ~counter~0 20)} #88#return; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,710 INFO L272 TraceCheckUtils]: 37: Hoare triple {6720#(< ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,710 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6497#true} {6720#(< ~counter~0 20)} #86#return; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,711 INFO L272 TraceCheckUtils]: 32: Hoare triple {6720#(< ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {6720#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {6790#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6720#(< ~counter~0 20)} is VALID [2022-04-27 12:54:49,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {6790#(< ~counter~0 19)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6790#(< ~counter~0 19)} is VALID [2022-04-27 12:54:49,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {6790#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {6790#(< ~counter~0 19)} is VALID [2022-04-27 12:54:49,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {6800#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6790#(< ~counter~0 19)} is VALID [2022-04-27 12:54:49,713 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6497#true} {6800#(< ~counter~0 18)} #84#return; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,713 INFO L272 TraceCheckUtils]: 22: Hoare triple {6800#(< ~counter~0 18)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,713 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6497#true} {6800#(< ~counter~0 18)} #82#return; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,714 INFO L272 TraceCheckUtils]: 17: Hoare triple {6800#(< ~counter~0 18)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {6800#(< ~counter~0 18)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,723 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6497#true} {6800#(< ~counter~0 18)} #80#return; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {6800#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6497#true} {6800#(< ~counter~0 18)} #78#return; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 12:54:49,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 12:54:49,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 12:54:49,725 INFO L272 TraceCheckUtils]: 6: Hoare triple {6800#(< ~counter~0 18)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6497#true} is VALID [2022-04-27 12:54:49,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {6800#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {6800#(< ~counter~0 18)} call #t~ret8 := main(); {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6800#(< ~counter~0 18)} {6497#true} #98#return; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {6800#(< ~counter~0 18)} assume true; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {6497#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6800#(< ~counter~0 18)} is VALID [2022-04-27 12:54:49,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {6497#true} call ULTIMATE.init(); {6497#true} is VALID [2022-04-27 12:54:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:54:49,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:49,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926277374] [2022-04-27 12:54:49,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:49,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723832572] [2022-04-27 12:54:49,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723832572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:54:49,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:54:49,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:54:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537605236] [2022-04-27 12:54:49,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-27 12:54:49,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:49,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:49,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:49,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:54:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:49,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:54:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:54:49,791 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:50,410 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2022-04-27 12:54:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:54:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-27 12:54:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2022-04-27 12:54:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2022-04-27 12:54:50,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 167 transitions. [2022-04-27 12:54:50,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:50,529 INFO L225 Difference]: With dead ends: 348 [2022-04-27 12:54:50,529 INFO L226 Difference]: Without dead ends: 252 [2022-04-27 12:54:50,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:54:50,530 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 85 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:50,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 266 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:54:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-27 12:54:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-04-27 12:54:50,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:50,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:50,726 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:50,726 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:50,731 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-27 12:54:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2022-04-27 12:54:50,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:50,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:50,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 252 states. [2022-04-27 12:54:50,732 INFO L87 Difference]: Start difference. First operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 252 states. [2022-04-27 12:54:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:50,737 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-27 12:54:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2022-04-27 12:54:50,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:50,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:50,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:50,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 12:54:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-04-27 12:54:50,745 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-04-27 12:54:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:50,745 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-04-27 12:54:50,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:54:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-04-27 12:54:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 12:54:50,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:50,746 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:50,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:50,950 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-27 12:54:50,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-27 12:54:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349225183] [2022-04-27 12:54:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:50,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:50,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662572079] [2022-04-27 12:54:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:50,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:50,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 12:54:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:51,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 12:54:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:51,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:52,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {8263#true} call ULTIMATE.init(); {8263#true} is VALID [2022-04-27 12:54:52,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8263#true} is VALID [2022-04-27 12:54:52,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8263#true} {8263#true} #98#return; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {8263#true} call #t~ret8 := main(); {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {8263#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {8263#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8263#true} {8263#true} #78#return; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {8263#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8263#true} {8263#true} #80#return; {8263#true} is VALID [2022-04-27 12:54:52,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:54:52,561 INFO L272 TraceCheckUtils]: 17: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,562 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8263#true} {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:54:52,562 INFO L272 TraceCheckUtils]: 22: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,563 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8263#true} {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:54:52,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:54:52,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:54:52,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 20);havoc #t~post7; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,565 INFO L272 TraceCheckUtils]: 32: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,566 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,566 INFO L272 TraceCheckUtils]: 37: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,566 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,567 INFO L272 TraceCheckUtils]: 42: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {8263#true} ~cond := #in~cond; {8399#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:52,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {8399#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:52,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:52,568 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,568 INFO L272 TraceCheckUtils]: 47: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,569 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:54:52,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,577 INFO L272 TraceCheckUtils]: 59: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:52,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:52,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:52,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:52,578 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8263#true} {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #86#return; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:54:52,579 INFO L272 TraceCheckUtils]: 64: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:52,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:52,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {8469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8264#false} is VALID [2022-04-27 12:54:52,579 INFO L290 TraceCheckUtils]: 67: Hoare triple {8264#false} assume !false; {8264#false} is VALID [2022-04-27 12:54:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 12:54:52,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:59,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {8264#false} assume !false; {8264#false} is VALID [2022-04-27 12:54:59,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {8469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8264#false} is VALID [2022-04-27 12:54:59,019 INFO L290 TraceCheckUtils]: 65: Hoare triple {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:59,020 INFO L272 TraceCheckUtils]: 64: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:59,020 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8263#true} {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,021 INFO L272 TraceCheckUtils]: 59: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:59,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:59,024 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8263#true} {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:59,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,024 INFO L272 TraceCheckUtils]: 47: Hoare triple {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,025 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} {8263#true} #90#return; {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:59,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:59,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {8550#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:59,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {8263#true} ~cond := #in~cond; {8550#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:54:59,026 INFO L272 TraceCheckUtils]: 42: Hoare triple {8263#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,026 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8263#true} {8263#true} #88#return; {8263#true} is VALID [2022-04-27 12:54:59,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,026 INFO L272 TraceCheckUtils]: 37: Hoare triple {8263#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,026 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8263#true} {8263#true} #86#return; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L272 TraceCheckUtils]: 32: Hoare triple {8263#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {8263#true} assume !!(#t~post7 < 20);havoc #t~post7; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {8263#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {8263#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {8263#true} assume !!(#t~post6 < 20);havoc #t~post6; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {8263#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8263#true} {8263#true} #84#return; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L272 TraceCheckUtils]: 22: Hoare triple {8263#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8263#true} {8263#true} #82#return; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L272 TraceCheckUtils]: 17: Hoare triple {8263#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8263#true} {8263#true} #80#return; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {8263#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8263#true} {8263#true} #78#return; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {8263#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {8263#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {8263#true} call #t~ret8 := main(); {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8263#true} {8263#true} #98#return; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8263#true} is VALID [2022-04-27 12:54:59,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {8263#true} call ULTIMATE.init(); {8263#true} is VALID [2022-04-27 12:54:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 12:54:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349225183] [2022-04-27 12:54:59,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662572079] [2022-04-27 12:54:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662572079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:54:59,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:54:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 12:54:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032546491] [2022-04-27 12:54:59,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:59,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-27 12:54:59,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:59,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:54:59,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:59,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:54:59,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:54:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:54:59,092 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:00,657 INFO L93 Difference]: Finished difference Result 334 states and 433 transitions. [2022-04-27 12:55:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 12:55:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-27 12:55:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-27 12:55:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-27 12:55:00,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-27 12:55:00,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:00,786 INFO L225 Difference]: With dead ends: 334 [2022-04-27 12:55:00,786 INFO L226 Difference]: Without dead ends: 328 [2022-04-27 12:55:00,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:55:00,787 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 46 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:00,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 295 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 12:55:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-27 12:55:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-04-27 12:55:01,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:01,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 12:55:01,025 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 12:55:01,026 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 12:55:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:01,033 INFO L93 Difference]: Finished difference Result 328 states and 421 transitions. [2022-04-27 12:55:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 421 transitions. [2022-04-27 12:55:01,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:01,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:01,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) Second operand 328 states. [2022-04-27 12:55:01,035 INFO L87 Difference]: Start difference. First operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) Second operand 328 states. [2022-04-27 12:55:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:01,042 INFO L93 Difference]: Finished difference Result 328 states and 421 transitions. [2022-04-27 12:55:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 421 transitions. [2022-04-27 12:55:01,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:01,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:01,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:01,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 12:55:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-04-27 12:55:01,051 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-04-27 12:55:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:01,051 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-04-27 12:55:01,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-04-27 12:55:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 12:55:01,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:01,052 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:01,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 12:55:01,261 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-27 12:55:01,261 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 2 times [2022-04-27 12:55:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137975509] [2022-04-27 12:55:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:01,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:01,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182784752] [2022-04-27 12:55:01,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:55:01,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:01,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:01,273 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:01,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 12:55:01,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:55:01,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:55:01,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 12:55:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:01,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:04,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2022-04-27 12:55:04,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10276#true} is VALID [2022-04-27 12:55:04,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #98#return; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {10276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10276#true} {10276#true} #78#return; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {10276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10276#true} {10276#true} #80#return; {10276#true} is VALID [2022-04-27 12:55:04,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,187 INFO L272 TraceCheckUtils]: 17: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,188 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10276#true} {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,188 INFO L272 TraceCheckUtils]: 22: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,189 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10276#true} {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= 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; {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,192 INFO L272 TraceCheckUtils]: 32: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,193 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10276#true} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,193 INFO L272 TraceCheckUtils]: 37: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,194 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10276#true} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,194 INFO L272 TraceCheckUtils]: 42: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#true} ~cond := #in~cond; {10412#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:04,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:04,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:04,196 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,196 INFO L272 TraceCheckUtils]: 47: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,197 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10276#true} {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:04,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,199 INFO L272 TraceCheckUtils]: 59: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,200 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10276#true} {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,200 INFO L272 TraceCheckUtils]: 64: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:04,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:04,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:04,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:04,201 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10276#true} {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:04,202 INFO L272 TraceCheckUtils]: 69: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:04,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:04,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {10498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10277#false} is VALID [2022-04-27 12:55:04,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-27 12:55:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 12:55:04,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:21,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-27 12:55:21,099 INFO L290 TraceCheckUtils]: 71: Hoare triple {10498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10277#false} is VALID [2022-04-27 12:55:21,099 INFO L290 TraceCheckUtils]: 70: Hoare triple {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:21,100 INFO L272 TraceCheckUtils]: 69: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:21,101 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10276#true} {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:21,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:21,101 INFO L290 TraceCheckUtils]: 66: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:21,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:21,101 INFO L272 TraceCheckUtils]: 64: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:21,102 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10276#true} {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:21,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:21,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:21,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:21,102 INFO L272 TraceCheckUtils]: 59: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:21,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:21,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:21,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:21,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:21,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:23,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:23,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 12:55:23,093 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10276#true} {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #92#return; {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 12:55:23,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,093 INFO L272 TraceCheckUtils]: 47: Hoare triple {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,094 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #90#return; {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 12:55:23,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:23,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {10595#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:23,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#true} ~cond := #in~cond; {10595#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:55:23,095 INFO L272 TraceCheckUtils]: 42: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,096 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10276#true} {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,096 INFO L272 TraceCheckUtils]: 37: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,096 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10276#true} {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,097 INFO L272 TraceCheckUtils]: 32: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post6 < 20);havoc #t~post6; {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,099 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10276#true} {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #84#return; {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,100 INFO L272 TraceCheckUtils]: 22: Hoare triple {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,100 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10276#true} {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #82#return; {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L272 TraceCheckUtils]: 17: Hoare triple {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10638#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:23,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10276#true} {10276#true} #80#return; {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {10276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10276#true} {10276#true} #78#return; {10276#true} is VALID [2022-04-27 12:55:23,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {10276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #98#return; {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10276#true} is VALID [2022-04-27 12:55:23,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2022-04-27 12:55:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 12:55:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:23,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137975509] [2022-04-27 12:55:23,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:23,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182784752] [2022-04-27 12:55:23,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182784752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:55:23,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:55:23,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-27 12:55:23,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689429397] [2022-04-27 12:55:23,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-27 12:55:23,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:23,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:23,383 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-27 12:55:23,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:55:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:55:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:55:23,385 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:27,820 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-04-27 12:55:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:55:27,820 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-27 12:55:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-27 12:55:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-27 12:55:27,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-27 12:55:30,173 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-27 12:55:30,181 INFO L225 Difference]: With dead ends: 319 [2022-04-27 12:55:30,181 INFO L226 Difference]: Without dead ends: 316 [2022-04-27 12:55:30,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:55:30,182 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:30,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 320 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 12:55:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-27 12:55:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-04-27 12:55:30,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:30,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 12:55:30,443 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 12:55:30,444 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 12:55:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:30,450 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2022-04-27 12:55:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2022-04-27 12:55:30,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:30,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:30,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand 316 states. [2022-04-27 12:55:30,451 INFO L87 Difference]: Start difference. First operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand 316 states. [2022-04-27 12:55:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:30,457 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2022-04-27 12:55:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2022-04-27 12:55:30,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:30,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:30,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:30,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 12:55:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-04-27 12:55:30,465 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-04-27 12:55:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:30,465 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-04-27 12:55:30,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-04-27 12:55:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 12:55:30,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:30,466 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:30,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 12:55:30,687 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-27 12:55:30,687 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 3 times [2022-04-27 12:55:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:30,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827993055] [2022-04-27 12:55:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:30,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146332763] [2022-04-27 12:55:30,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:55:30,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:30,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:30,699 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:30,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 12:55:30,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 12:55:30,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:55:30,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 12:55:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:30,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:34,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {12281#true} call ULTIMATE.init(); {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {12281#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12281#true} {12281#true} #98#return; {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {12281#true} call #t~ret8 := main(); {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {12281#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {12281#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12281#true} {12281#true} #78#return; {12281#true} is VALID [2022-04-27 12:55:34,809 INFO L272 TraceCheckUtils]: 11: Hoare triple {12281#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,809 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12281#true} {12281#true} #80#return; {12281#true} is VALID [2022-04-27 12:55:34,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {12281#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,810 INFO L272 TraceCheckUtils]: 17: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12281#true} {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,811 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12281#true} {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,814 INFO L272 TraceCheckUtils]: 32: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,815 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,815 INFO L272 TraceCheckUtils]: 37: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,816 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,816 INFO L272 TraceCheckUtils]: 42: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,817 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,817 INFO L272 TraceCheckUtils]: 47: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,818 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:34,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,821 INFO L272 TraceCheckUtils]: 59: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,821 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12281#true} {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,822 INFO L272 TraceCheckUtils]: 64: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-27 12:55:34,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-27 12:55:34,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-27 12:55:34,822 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12281#true} {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,823 INFO L272 TraceCheckUtils]: 69: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12281#true} is VALID [2022-04-27 12:55:34,823 INFO L290 TraceCheckUtils]: 70: Hoare triple {12281#true} ~cond := #in~cond; {12499#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:34,823 INFO L290 TraceCheckUtils]: 71: Hoare triple {12499#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:34,823 INFO L290 TraceCheckUtils]: 72: Hoare triple {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:34,824 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:55:34,825 INFO L272 TraceCheckUtils]: 74: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12513#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:34,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {12513#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12517#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:34,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {12517#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12282#false} is VALID [2022-04-27 12:55:34,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {12282#false} assume !false; {12282#false} is VALID [2022-04-27 12:55:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-27 12:55:34,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:56:21,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:56:21,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827993055] [2022-04-27 12:56:21,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:56:21,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146332763] [2022-04-27 12:56:21,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146332763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:56:21,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:56:21,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:56:21,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915893085] [2022-04-27 12:56:21,088 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:56:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-27 12:56:21,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:56:21,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:21,133 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-27 12:56:21,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:56:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:56:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:56:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:56:21,134 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:22,098 INFO L93 Difference]: Finished difference Result 337 states and 411 transitions. [2022-04-27 12:56:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:56:22,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-27 12:56:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:56:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 12:56:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 12:56:22,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-27 12:56:22,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:56:22,269 INFO L225 Difference]: With dead ends: 337 [2022-04-27 12:56:22,269 INFO L226 Difference]: Without dead ends: 333 [2022-04-27 12:56:22,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:56:22,270 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:56:22,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 233 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:56:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-27 12:56:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-04-27 12:56:22,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:56:22,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 12:56:22,542 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 12:56:22,542 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 12:56:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:22,548 INFO L93 Difference]: Finished difference Result 333 states and 405 transitions. [2022-04-27 12:56:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2022-04-27 12:56:22,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:56:22,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:56:22,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 333 states. [2022-04-27 12:56:22,550 INFO L87 Difference]: Start difference. First operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 333 states. [2022-04-27 12:56:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:22,556 INFO L93 Difference]: Finished difference Result 333 states and 405 transitions. [2022-04-27 12:56:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2022-04-27 12:56:22,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:56:22,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:56:22,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:56:22,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:56:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 12:56:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-04-27 12:56:22,564 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-04-27 12:56:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:56:22,564 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-04-27 12:56:22,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-04-27 12:56:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 12:56:22,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:56:22,565 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:56:22,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 12:56:22,793 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-27 12:56:22,794 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:56:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:56:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-27 12:56:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:56:22,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802543793] [2022-04-27 12:56:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:56:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:56:22,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:56:22,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124160272] [2022-04-27 12:56:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:56:22,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:56:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:56:22,816 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-27 12:56:22,817 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-27 12:56:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:56:22,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 12:56:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:56:22,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:56:23,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2022-04-27 12:56:23,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {14173#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14173#true} is VALID [2022-04-27 12:56:23,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14173#true} {14173#true} #98#return; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {14173#true} call #t~ret8 := main(); {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {14173#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {14173#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14173#true} {14173#true} #78#return; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {14173#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,522 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14173#true} {14173#true} #80#return; {14173#true} is VALID [2022-04-27 12:56:23,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {14173#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,522 INFO L272 TraceCheckUtils]: 17: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,523 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14173#true} {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,523 INFO L272 TraceCheckUtils]: 22: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,524 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14173#true} {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= 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; {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,527 INFO L272 TraceCheckUtils]: 32: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,528 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14173#true} {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,528 INFO L272 TraceCheckUtils]: 37: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,529 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14173#true} {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,529 INFO L272 TraceCheckUtils]: 42: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,530 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14173#true} {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,530 INFO L272 TraceCheckUtils]: 47: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,531 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14173#true} {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {14266#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,533 INFO L272 TraceCheckUtils]: 55: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,533 INFO L290 TraceCheckUtils]: 56: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,534 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14173#true} {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,534 INFO L272 TraceCheckUtils]: 60: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {14173#true} ~cond := #in~cond; {14364#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:56:23,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {14364#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:56:23,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:56:23,536 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,537 INFO L272 TraceCheckUtils]: 65: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,537 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14173#true} {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,538 INFO L272 TraceCheckUtils]: 70: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:56:23,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:56:23,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:56:23,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:56:23,538 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14173#true} {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:23,540 INFO L290 TraceCheckUtils]: 76: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 12:56:23,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 12:56:23,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 12:56:23,541 INFO L290 TraceCheckUtils]: 79: Hoare triple {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {14422#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 12:56:23,542 INFO L272 TraceCheckUtils]: 80: Hoare triple {14422#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:56:23,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:56:23,542 INFO L290 TraceCheckUtils]: 82: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14174#false} is VALID [2022-04-27 12:56:23,542 INFO L290 TraceCheckUtils]: 83: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2022-04-27 12:56:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-27 12:56:23,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:57:09,924 INFO L290 TraceCheckUtils]: 83: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2022-04-27 12:57:09,924 INFO L290 TraceCheckUtils]: 82: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14174#false} is VALID [2022-04-27 12:57:09,925 INFO L290 TraceCheckUtils]: 81: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:57:09,925 INFO L272 TraceCheckUtils]: 80: Hoare triple {14446#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:57:09,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {14446#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-27 12:57:09,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 12:57:09,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 12:57:11,928 WARN L290 TraceCheckUtils]: 76: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-27 12:57:11,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:11,929 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14173#true} {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #92#return; {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:11,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:11,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:11,930 INFO L290 TraceCheckUtils]: 71: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:11,930 INFO L272 TraceCheckUtils]: 70: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:11,930 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14173#true} {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:11,930 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:11,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:11,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:11,931 INFO L272 TraceCheckUtils]: 65: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:11,932 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:11,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:11,932 INFO L290 TraceCheckUtils]: 62: Hoare triple {14507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:11,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {14173#true} ~cond := #in~cond; {14507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:57:11,933 INFO L272 TraceCheckUtils]: 60: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:11,933 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14173#true} {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:11,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:11,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:11,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:11,934 INFO L272 TraceCheckUtils]: 55: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:11,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !!(#t~post7 < 20);havoc #t~post7; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:11,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:12,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:12,205 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #92#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,205 INFO L272 TraceCheckUtils]: 47: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,206 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #90#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,207 INFO L272 TraceCheckUtils]: 42: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,207 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #88#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,208 INFO L272 TraceCheckUtils]: 37: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,209 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #86#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,209 INFO L272 TraceCheckUtils]: 32: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 20);havoc #t~post7; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:12,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:12,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:12,213 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14173#true} {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #84#return; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:12,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,214 INFO L272 TraceCheckUtils]: 22: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,214 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14173#true} {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #82#return; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:12,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,215 INFO L272 TraceCheckUtils]: 17: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {14173#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:12,216 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14173#true} {14173#true} #80#return; {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L272 TraceCheckUtils]: 11: Hoare triple {14173#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14173#true} {14173#true} #78#return; {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {14173#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-27 12:57:12,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {14173#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {14173#true} is VALID [2022-04-27 12:57:12,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {14173#true} call #t~ret8 := main(); {14173#true} is VALID [2022-04-27 12:57:12,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14173#true} {14173#true} #98#return; {14173#true} is VALID [2022-04-27 12:57:12,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-27 12:57:12,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {14173#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14173#true} is VALID [2022-04-27 12:57:12,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2022-04-27 12:57:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-27 12:57:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:57:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802543793] [2022-04-27 12:57:12,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:57:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124160272] [2022-04-27 12:57:12,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124160272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:57:12,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:57:12,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-27 12:57:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112583617] [2022-04-27 12:57:12,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:57:12,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-27 12:57:12,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:57:12,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:12,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:57:12,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 12:57:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:57:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 12:57:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:57:12,834 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:57:19,989 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2022-04-27 12:57:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 12:57:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-27 12:57:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:57:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-27 12:57:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-27 12:57:19,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 173 transitions. [2022-04-27 12:57:22,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:57:22,633 INFO L225 Difference]: With dead ends: 392 [2022-04-27 12:57:22,633 INFO L226 Difference]: Without dead ends: 377 [2022-04-27 12:57:22,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 12:57:22,634 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:57:22,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 345 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-27 12:57:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-27 12:57:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-04-27 12:57:22,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:57:22,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:57:22,883 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:57:22,883 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:57:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:57:22,892 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2022-04-27 12:57:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 469 transitions. [2022-04-27 12:57:22,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:57:22,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:57:22,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 377 states. [2022-04-27 12:57:22,894 INFO L87 Difference]: Start difference. First operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 377 states. [2022-04-27 12:57:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:57:22,903 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2022-04-27 12:57:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 469 transitions. [2022-04-27 12:57:22,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:57:22,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:57:22,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:57:22,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:57:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:57:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-04-27 12:57:22,916 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-04-27 12:57:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:57:22,917 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-04-27 12:57:22,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-04-27 12:57:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 12:57:22,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:57:22,918 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:57:22,939 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-27 12:57:23,131 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-27 12:57:23,131 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:57:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:57:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-27 12:57:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:57:23,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798618848] [2022-04-27 12:57:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:57:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:57:23,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:57:23,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823127991] [2022-04-27 12:57:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:57:23,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:57:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:57:23,145 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-27 12:57:23,147 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-27 12:57:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:57:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 12:57:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:57:23,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:57:30,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {16583#true} call ULTIMATE.init(); {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {16583#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16583#true} {16583#true} #98#return; {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {16583#true} call #t~ret8 := main(); {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {16583#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {16583#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16583#true} {16583#true} #78#return; {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L272 TraceCheckUtils]: 11: Hoare triple {16583#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16583#true} {16583#true} #80#return; {16583#true} is VALID [2022-04-27 12:57:30,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {16583#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:57:30,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,874 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16583#true} {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:57:30,875 INFO L272 TraceCheckUtils]: 22: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,875 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16583#true} {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:57:30,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:57:30,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:57:30,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 20);havoc #t~post7; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,878 INFO L272 TraceCheckUtils]: 32: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,879 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #86#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,879 INFO L272 TraceCheckUtils]: 37: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,880 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #88#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,880 INFO L272 TraceCheckUtils]: 42: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,881 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #90#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,881 INFO L272 TraceCheckUtils]: 47: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,882 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #92#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:57:30,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,883 INFO L272 TraceCheckUtils]: 55: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,884 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,884 INFO L272 TraceCheckUtils]: 60: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,885 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,885 INFO L272 TraceCheckUtils]: 65: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,885 INFO L290 TraceCheckUtils]: 67: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,885 INFO L290 TraceCheckUtils]: 68: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,886 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,886 INFO L272 TraceCheckUtils]: 70: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,887 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,889 INFO L290 TraceCheckUtils]: 77: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,889 INFO L290 TraceCheckUtils]: 78: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,889 INFO L290 TraceCheckUtils]: 79: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,890 INFO L290 TraceCheckUtils]: 81: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,890 INFO L272 TraceCheckUtils]: 82: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,890 INFO L290 TraceCheckUtils]: 83: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,890 INFO L290 TraceCheckUtils]: 84: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,891 INFO L290 TraceCheckUtils]: 85: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,891 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16583#true} {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,891 INFO L272 TraceCheckUtils]: 87: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-27 12:57:30,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-27 12:57:30,891 INFO L290 TraceCheckUtils]: 90: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-27 12:57:30,892 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16583#true} {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,892 INFO L272 TraceCheckUtils]: 92: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-27 12:57:30,892 INFO L290 TraceCheckUtils]: 93: Hoare triple {16583#true} ~cond := #in~cond; {16871#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:57:30,893 INFO L290 TraceCheckUtils]: 94: Hoare triple {16871#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:30,893 INFO L290 TraceCheckUtils]: 95: Hoare triple {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:30,894 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16882#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:57:30,915 INFO L272 TraceCheckUtils]: 97: Hoare triple {16882#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:57:30,915 INFO L290 TraceCheckUtils]: 98: Hoare triple {16886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:57:30,915 INFO L290 TraceCheckUtils]: 99: Hoare triple {16890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16584#false} is VALID [2022-04-27 12:57:30,915 INFO L290 TraceCheckUtils]: 100: Hoare triple {16584#false} assume !false; {16584#false} is VALID [2022-04-27 12:57:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-27 12:57:30,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:58:13,403 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:58:14,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:58:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798618848] [2022-04-27 12:58:14,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:58:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823127991] [2022-04-27 12:58:14,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823127991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:58:14,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:58:14,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 12:58:14,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246009962] [2022-04-27 12:58:14,493 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:58:14,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-27 12:58:14,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:58:14,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:58:14,581 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-27 12:58:14,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 12:58:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:58:14,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 12:58:14,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:58:14,582 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:58:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:26,215 INFO L93 Difference]: Finished difference Result 377 states and 468 transitions. [2022-04-27 12:58:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:58:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-27 12:58:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:58:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:58:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-27 12:58:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:58:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-27 12:58:26,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 116 transitions. [2022-04-27 12:58:26,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:26,393 INFO L225 Difference]: With dead ends: 377 [2022-04-27 12:58:26,394 INFO L226 Difference]: Without dead ends: 375 [2022-04-27 12:58:26,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:58:26,394 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:58:26,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 315 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 12:58:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-27 12:58:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-04-27 12:58:26,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:58:26,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:58:26,688 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:58:26,689 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:58:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:26,696 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-27 12:58:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 465 transitions. [2022-04-27 12:58:26,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:26,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:26,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 375 states. [2022-04-27 12:58:26,698 INFO L87 Difference]: Start difference. First operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 375 states. [2022-04-27 12:58:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:26,704 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-27 12:58:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 465 transitions. [2022-04-27 12:58:26,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:26,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:26,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:58:26,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:58:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 12:58:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-04-27 12:58:26,714 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-04-27 12:58:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:58:26,715 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-04-27 12:58:26,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:58:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-04-27 12:58:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 12:58:26,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:58:26,716 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:58:26,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 12:58:26,935 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-27 12:58:26,935 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:58:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:58:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2076615365, now seen corresponding path program 4 times [2022-04-27 12:58:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:58:26,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779072785] [2022-04-27 12:58:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:58:26,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:58:26,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836995848] [2022-04-27 12:58:26,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:58:26,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:58:26,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:58:26,962 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-27 12:58:26,962 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-27 12:58:27,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:58:27,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:58:27,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:58:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:27,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:58:27,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {18820#true} call ULTIMATE.init(); {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {18820#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18820#true} {18820#true} #98#return; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {18820#true} call #t~ret8 := main(); {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {18820#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {18820#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18820#true} {18820#true} #78#return; {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {18820#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18820#true} {18820#true} #80#return; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {18820#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L272 TraceCheckUtils]: 17: Hoare triple {18820#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18820#true} {18820#true} #82#return; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L272 TraceCheckUtils]: 22: Hoare triple {18820#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18820#true} {18820#true} #84#return; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {18820#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {18820#true} assume !!(#t~post6 < 20);havoc #t~post6; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {18820#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {18820#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {18820#true} assume !!(#t~post7 < 20);havoc #t~post7; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L272 TraceCheckUtils]: 32: Hoare triple {18820#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18820#true} {18820#true} #86#return; {18820#true} is VALID [2022-04-27 12:58:27,266 INFO L272 TraceCheckUtils]: 37: Hoare triple {18820#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18820#true} {18820#true} #88#return; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L272 TraceCheckUtils]: 42: Hoare triple {18820#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18820#true} {18820#true} #90#return; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L272 TraceCheckUtils]: 47: Hoare triple {18820#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,268 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18820#true} {18820#true} #92#return; {18820#true} is VALID [2022-04-27 12:58:27,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {18820#true} assume !(~c~0 >= ~b~0); {18981#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 12:58:27,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {18981#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18985#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:58:27,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {18985#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18985#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:58:27,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {18985#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 20);havoc #t~post6; {18985#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:58:27,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {18985#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {18995#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {18995#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,270 INFO L272 TraceCheckUtils]: 59: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,271 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #86#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,271 INFO L272 TraceCheckUtils]: 64: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,272 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #88#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,272 INFO L272 TraceCheckUtils]: 69: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,272 INFO L290 TraceCheckUtils]: 71: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,272 INFO L290 TraceCheckUtils]: 72: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,272 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #90#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,272 INFO L272 TraceCheckUtils]: 74: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18820#true} is VALID [2022-04-27 12:58:27,273 INFO L290 TraceCheckUtils]: 75: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-27 12:58:27,273 INFO L290 TraceCheckUtils]: 76: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-27 12:58:27,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-27 12:58:27,273 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #92#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 79: Hoare triple {18995#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 80: Hoare triple {18821#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 81: Hoare triple {18821#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 82: Hoare triple {18821#false} assume !!(#t~post6 < 20);havoc #t~post6; {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 83: Hoare triple {18821#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {18821#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {18821#false} assume !!(#t~post7 < 20);havoc #t~post7; {18821#false} is VALID [2022-04-27 12:58:27,274 INFO L272 TraceCheckUtils]: 86: Hoare triple {18821#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 87: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {18821#false} assume !(0 == ~cond); {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {18821#false} assume true; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18821#false} {18821#false} #86#return; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L272 TraceCheckUtils]: 91: Hoare triple {18821#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 92: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 93: Hoare triple {18821#false} assume !(0 == ~cond); {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 94: Hoare triple {18821#false} assume true; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18821#false} {18821#false} #88#return; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L272 TraceCheckUtils]: 96: Hoare triple {18821#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 97: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-27 12:58:27,275 INFO L290 TraceCheckUtils]: 98: Hoare triple {18821#false} assume !(0 == ~cond); {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {18821#false} assume true; {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18821#false} {18821#false} #90#return; {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L272 TraceCheckUtils]: 101: Hoare triple {18821#false} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L290 TraceCheckUtils]: 102: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L290 TraceCheckUtils]: 103: Hoare triple {18821#false} assume 0 == ~cond; {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L290 TraceCheckUtils]: 104: Hoare triple {18821#false} assume !false; {18821#false} is VALID [2022-04-27 12:58:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-27 12:58:27,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:58:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:58:27,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779072785] [2022-04-27 12:58:27,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:58:27,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836995848] [2022-04-27 12:58:27,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836995848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:58:27,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:58:27,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:58:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011803125] [2022-04-27 12:58:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:58:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-27 12:58:27,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:58:27,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 12:58:27,328 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-27 12:58:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:58:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:58:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:58:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:58:27,329 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 12:58:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:28,030 INFO L93 Difference]: Finished difference Result 535 states and 713 transitions. [2022-04-27 12:58:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:58:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-27 12:58:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:58:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 12:58:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 12:58:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 12:58:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 12:58:28,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-27 12:58:28,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:28,128 INFO L225 Difference]: With dead ends: 535 [2022-04-27 12:58:28,128 INFO L226 Difference]: Without dead ends: 417 [2022-04-27 12:58:28,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:58:28,129 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:58:28,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:58:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-27 12:58:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-04-27 12:58:28,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:58:28,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 12:58:28,488 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 12:58:28,488 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 12:58:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:28,497 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-27 12:58:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-04-27 12:58:28,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:28,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:28,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) Second operand 417 states. [2022-04-27 12:58:28,499 INFO L87 Difference]: Start difference. First operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) Second operand 417 states. [2022-04-27 12:58:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:28,508 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-27 12:58:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-04-27 12:58:28,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:28,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:28,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:58:28,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:58:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 12:58:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-04-27 12:58:28,518 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-04-27 12:58:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:58:28,519 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-04-27 12:58:28,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 12:58:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-04-27 12:58:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 12:58:28,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:58:28,520 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:58:28,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 12:58:28,735 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-27 12:58:28,735 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:58:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:58:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 1 times [2022-04-27 12:58:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:58:28,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77861314] [2022-04-27 12:58:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:58:28,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:58:28,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900521197] [2022-04-27 12:58:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:28,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:58:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:58:28,756 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-27 12:58:28,757 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-27 12:58:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:28,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 12:58:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:28,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:58:29,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {21320#true} call ULTIMATE.init(); {21320#true} is VALID [2022-04-27 12:58:29,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {21320#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21328#(<= ~counter~0 0)} {21320#true} #98#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {21328#(<= ~counter~0 0)} call #t~ret8 := main(); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {21328#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #78#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #80#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {21328#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,293 INFO L272 TraceCheckUtils]: 17: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,294 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #82#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,295 INFO L272 TraceCheckUtils]: 22: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,296 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #84#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-27 12:58:29,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {21328#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21407#(<= ~counter~0 1)} is VALID [2022-04-27 12:58:29,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {21407#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {21407#(<= ~counter~0 1)} is VALID [2022-04-27 12:58:29,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {21407#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21407#(<= ~counter~0 1)} is VALID [2022-04-27 12:58:29,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {21407#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {21417#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,298 INFO L272 TraceCheckUtils]: 32: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,300 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #86#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,300 INFO L272 TraceCheckUtils]: 37: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,301 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #88#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,302 INFO L272 TraceCheckUtils]: 42: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,303 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #90#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,304 INFO L272 TraceCheckUtils]: 47: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,305 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #92#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {21417#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {21417#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21417#(<= ~counter~0 2)} is VALID [2022-04-27 12:58:29,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {21417#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21490#(<= ~counter~0 3)} is VALID [2022-04-27 12:58:29,307 INFO L290 TraceCheckUtils]: 55: Hoare triple {21490#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {21490#(<= ~counter~0 3)} is VALID [2022-04-27 12:58:29,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {21490#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21490#(<= ~counter~0 3)} is VALID [2022-04-27 12:58:29,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {21490#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {21500#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,308 INFO L272 TraceCheckUtils]: 59: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,309 INFO L290 TraceCheckUtils]: 60: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,310 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #86#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,310 INFO L272 TraceCheckUtils]: 64: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,311 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #88#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,312 INFO L272 TraceCheckUtils]: 69: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,312 INFO L290 TraceCheckUtils]: 70: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,312 INFO L290 TraceCheckUtils]: 71: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,313 INFO L290 TraceCheckUtils]: 72: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,313 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #90#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,314 INFO L272 TraceCheckUtils]: 74: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,314 INFO L290 TraceCheckUtils]: 76: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,315 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #92#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {21500#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21500#(<= ~counter~0 4)} is VALID [2022-04-27 12:58:29,316 INFO L290 TraceCheckUtils]: 80: Hoare triple {21500#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,316 INFO L290 TraceCheckUtils]: 81: Hoare triple {21570#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,317 INFO L272 TraceCheckUtils]: 82: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,317 INFO L290 TraceCheckUtils]: 83: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,317 INFO L290 TraceCheckUtils]: 84: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,318 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #86#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,319 INFO L272 TraceCheckUtils]: 87: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,319 INFO L290 TraceCheckUtils]: 88: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,319 INFO L290 TraceCheckUtils]: 89: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,320 INFO L290 TraceCheckUtils]: 90: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,320 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #88#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,321 INFO L272 TraceCheckUtils]: 92: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,321 INFO L290 TraceCheckUtils]: 93: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,321 INFO L290 TraceCheckUtils]: 94: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,321 INFO L290 TraceCheckUtils]: 95: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,322 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #90#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,323 INFO L272 TraceCheckUtils]: 97: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,324 INFO L290 TraceCheckUtils]: 99: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,324 INFO L290 TraceCheckUtils]: 100: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,324 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #92#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,325 INFO L290 TraceCheckUtils]: 102: Hoare triple {21570#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,325 INFO L290 TraceCheckUtils]: 103: Hoare triple {21570#(<= ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21570#(<= ~counter~0 5)} is VALID [2022-04-27 12:58:29,326 INFO L290 TraceCheckUtils]: 104: Hoare triple {21570#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21643#(<= ~counter~0 6)} is VALID [2022-04-27 12:58:29,326 INFO L290 TraceCheckUtils]: 105: Hoare triple {21643#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {21643#(<= ~counter~0 6)} is VALID [2022-04-27 12:58:29,326 INFO L290 TraceCheckUtils]: 106: Hoare triple {21643#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21643#(<= ~counter~0 6)} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 107: Hoare triple {21643#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21653#(<= |main_#t~post7| 6)} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 108: Hoare triple {21653#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {21321#false} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 109: Hoare triple {21321#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21321#false} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 110: Hoare triple {21321#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21321#false} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 111: Hoare triple {21321#false} assume !(#t~post6 < 20);havoc #t~post6; {21321#false} is VALID [2022-04-27 12:58:29,327 INFO L272 TraceCheckUtils]: 112: Hoare triple {21321#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {21321#false} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 113: Hoare triple {21321#false} ~cond := #in~cond; {21321#false} is VALID [2022-04-27 12:58:29,327 INFO L290 TraceCheckUtils]: 114: Hoare triple {21321#false} assume 0 == ~cond; {21321#false} is VALID [2022-04-27 12:58:29,328 INFO L290 TraceCheckUtils]: 115: Hoare triple {21321#false} assume !false; {21321#false} is VALID [2022-04-27 12:58:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-27 12:58:29,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:58:29,771 INFO L290 TraceCheckUtils]: 115: Hoare triple {21321#false} assume !false; {21321#false} is VALID [2022-04-27 12:58:29,771 INFO L290 TraceCheckUtils]: 114: Hoare triple {21321#false} assume 0 == ~cond; {21321#false} is VALID [2022-04-27 12:58:29,771 INFO L290 TraceCheckUtils]: 113: Hoare triple {21321#false} ~cond := #in~cond; {21321#false} is VALID [2022-04-27 12:58:29,771 INFO L272 TraceCheckUtils]: 112: Hoare triple {21321#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {21321#false} is VALID [2022-04-27 12:58:29,772 INFO L290 TraceCheckUtils]: 111: Hoare triple {21321#false} assume !(#t~post6 < 20);havoc #t~post6; {21321#false} is VALID [2022-04-27 12:58:29,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {21321#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21321#false} is VALID [2022-04-27 12:58:29,772 INFO L290 TraceCheckUtils]: 109: Hoare triple {21321#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21321#false} is VALID [2022-04-27 12:58:29,772 INFO L290 TraceCheckUtils]: 108: Hoare triple {21699#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {21321#false} is VALID [2022-04-27 12:58:29,772 INFO L290 TraceCheckUtils]: 107: Hoare triple {21703#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21699#(< |main_#t~post7| 20)} is VALID [2022-04-27 12:58:29,773 INFO L290 TraceCheckUtils]: 106: Hoare triple {21703#(< ~counter~0 20)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21703#(< ~counter~0 20)} is VALID [2022-04-27 12:58:29,773 INFO L290 TraceCheckUtils]: 105: Hoare triple {21703#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {21703#(< ~counter~0 20)} is VALID [2022-04-27 12:58:29,774 INFO L290 TraceCheckUtils]: 104: Hoare triple {21713#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21703#(< ~counter~0 20)} is VALID [2022-04-27 12:58:29,774 INFO L290 TraceCheckUtils]: 103: Hoare triple {21713#(< ~counter~0 19)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,774 INFO L290 TraceCheckUtils]: 102: Hoare triple {21713#(< ~counter~0 19)} assume !(~c~0 >= ~b~0); {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,775 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21320#true} {21713#(< ~counter~0 19)} #92#return; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,775 INFO L290 TraceCheckUtils]: 100: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,775 INFO L290 TraceCheckUtils]: 99: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,775 INFO L290 TraceCheckUtils]: 98: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,775 INFO L272 TraceCheckUtils]: 97: Hoare triple {21713#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,776 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21320#true} {21713#(< ~counter~0 19)} #90#return; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,776 INFO L272 TraceCheckUtils]: 92: Hoare triple {21713#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,779 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21320#true} {21713#(< ~counter~0 19)} #88#return; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,779 INFO L290 TraceCheckUtils]: 88: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,780 INFO L272 TraceCheckUtils]: 87: Hoare triple {21713#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,780 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21320#true} {21713#(< ~counter~0 19)} #86#return; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,780 INFO L290 TraceCheckUtils]: 83: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,780 INFO L272 TraceCheckUtils]: 82: Hoare triple {21713#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,781 INFO L290 TraceCheckUtils]: 81: Hoare triple {21713#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,781 INFO L290 TraceCheckUtils]: 80: Hoare triple {21786#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21713#(< ~counter~0 19)} is VALID [2022-04-27 12:58:29,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {21786#(< ~counter~0 18)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,782 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21320#true} {21786#(< ~counter~0 18)} #92#return; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,782 INFO L290 TraceCheckUtils]: 75: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,783 INFO L272 TraceCheckUtils]: 74: Hoare triple {21786#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,783 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21320#true} {21786#(< ~counter~0 18)} #90#return; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,783 INFO L272 TraceCheckUtils]: 69: Hoare triple {21786#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,784 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21320#true} {21786#(< ~counter~0 18)} #88#return; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,784 INFO L272 TraceCheckUtils]: 64: Hoare triple {21786#(< ~counter~0 18)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,785 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21320#true} {21786#(< ~counter~0 18)} #86#return; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,785 INFO L272 TraceCheckUtils]: 59: Hoare triple {21786#(< ~counter~0 18)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {21786#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {21856#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21786#(< ~counter~0 18)} is VALID [2022-04-27 12:58:29,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {21856#(< ~counter~0 17)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21856#(< ~counter~0 17)} is VALID [2022-04-27 12:58:29,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {21856#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {21856#(< ~counter~0 17)} is VALID [2022-04-27 12:58:29,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {21866#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21856#(< ~counter~0 17)} is VALID [2022-04-27 12:58:29,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {21866#(< ~counter~0 16)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {21866#(< ~counter~0 16)} assume !(~c~0 >= ~b~0); {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,788 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21320#true} {21866#(< ~counter~0 16)} #92#return; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,789 INFO L272 TraceCheckUtils]: 47: Hoare triple {21866#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,789 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21320#true} {21866#(< ~counter~0 16)} #90#return; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,789 INFO L272 TraceCheckUtils]: 42: Hoare triple {21866#(< ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,790 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21320#true} {21866#(< ~counter~0 16)} #88#return; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,790 INFO L272 TraceCheckUtils]: 37: Hoare triple {21866#(< ~counter~0 16)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,791 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21320#true} {21866#(< ~counter~0 16)} #86#return; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,791 INFO L272 TraceCheckUtils]: 32: Hoare triple {21866#(< ~counter~0 16)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {21866#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {21939#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21866#(< ~counter~0 16)} is VALID [2022-04-27 12:58:29,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {21939#(< ~counter~0 15)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21939#(< ~counter~0 15)} is VALID [2022-04-27 12:58:29,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {21939#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {21939#(< ~counter~0 15)} is VALID [2022-04-27 12:58:29,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {21949#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21939#(< ~counter~0 15)} is VALID [2022-04-27 12:58:29,802 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21320#true} {21949#(< ~counter~0 14)} #84#return; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,802 INFO L272 TraceCheckUtils]: 22: Hoare triple {21949#(< ~counter~0 14)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,803 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21320#true} {21949#(< ~counter~0 14)} #82#return; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,803 INFO L272 TraceCheckUtils]: 17: Hoare triple {21949#(< ~counter~0 14)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {21949#(< ~counter~0 14)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21320#true} {21949#(< ~counter~0 14)} #80#return; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {21949#(< ~counter~0 14)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21320#true} {21949#(< ~counter~0 14)} #78#return; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-27 12:58:29,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-27 12:58:29,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-27 12:58:29,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {21949#(< ~counter~0 14)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21320#true} is VALID [2022-04-27 12:58:29,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {21949#(< ~counter~0 14)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {21949#(< ~counter~0 14)} call #t~ret8 := main(); {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21949#(< ~counter~0 14)} {21320#true} #98#return; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {21949#(< ~counter~0 14)} assume true; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {21320#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21949#(< ~counter~0 14)} is VALID [2022-04-27 12:58:29,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {21320#true} call ULTIMATE.init(); {21320#true} is VALID [2022-04-27 12:58:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-27 12:58:29,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:58:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77861314] [2022-04-27 12:58:29,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:58:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900521197] [2022-04-27 12:58:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900521197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:58:29,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:58:29,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 12:58:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883538119] [2022-04-27 12:58:29,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:58:29,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-27 12:58:29,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:58:29,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:58:29,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:29,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 12:58:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:58:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 12:58:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:58:29,938 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:58:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:32,917 INFO L93 Difference]: Finished difference Result 1393 states and 1817 transitions. [2022-04-27 12:58:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 12:58:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-27 12:58:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:58:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:58:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 344 transitions. [2022-04-27 12:58:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:58:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 344 transitions. [2022-04-27 12:58:32,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 344 transitions. [2022-04-27 12:58:33,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:33,251 INFO L225 Difference]: With dead ends: 1393 [2022-04-27 12:58:33,251 INFO L226 Difference]: Without dead ends: 1260 [2022-04-27 12:58:33,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-04-27 12:58:33,253 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 285 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:58:33,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 479 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:58:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-27 12:58:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-04-27 12:58:34,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:58:34,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 12:58:34,386 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 12:58:34,387 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 12:58:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:34,436 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-27 12:58:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1555 transitions. [2022-04-27 12:58:34,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:34,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:34,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) Second operand 1260 states. [2022-04-27 12:58:34,442 INFO L87 Difference]: Start difference. First operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) Second operand 1260 states. [2022-04-27 12:58:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:34,486 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-27 12:58:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1555 transitions. [2022-04-27 12:58:34,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:34,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:34,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:58:34,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:58:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 12:58:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-04-27 12:58:34,548 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-04-27 12:58:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:58:34,548 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-04-27 12:58:34,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:58:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-04-27 12:58:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 12:58:34,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:58:34,549 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-27 12:58:34,576 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-27 12:58:34,762 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-27 12:58:34,763 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:58:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:58:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 2 times [2022-04-27 12:58:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:58:34,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786412041] [2022-04-27 12:58:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:58:34,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:58:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430427636] [2022-04-27 12:58:34,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:58:34,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:58:34,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:58:34,786 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-27 12:58:34,788 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-27 12:58:34,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:58:34,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:58:34,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-27 12:58:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:34,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:58:46,993 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:58:50,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {28358#true} call ULTIMATE.init(); {28358#true} is VALID [2022-04-27 12:58:50,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {28358#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28358#true} is VALID [2022-04-27 12:58:50,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28358#true} {28358#true} #98#return; {28358#true} is VALID [2022-04-27 12:58:50,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {28358#true} call #t~ret8 := main(); {28358#true} is VALID [2022-04-27 12:58:50,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {28358#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {28358#true} is VALID [2022-04-27 12:58:50,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {28358#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28358#true} {28358#true} #78#return; {28358#true} is VALID [2022-04-27 12:58:50,029 INFO L272 TraceCheckUtils]: 11: Hoare triple {28358#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {28358#true} ~cond := #in~cond; {28399#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:58:50,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {28399#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {28403#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:58:50,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {28403#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {28403#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:58:50,030 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28403#(not (= |assume_abort_if_not_#in~cond| 0))} {28358#true} #80#return; {28410#(<= 1 main_~y~0)} is VALID [2022-04-27 12:58:50,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {28410#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,031 INFO L272 TraceCheckUtils]: 17: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,032 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28358#true} {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,032 INFO L272 TraceCheckUtils]: 22: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,033 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28358#true} {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,036 INFO L272 TraceCheckUtils]: 32: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,037 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,037 INFO L272 TraceCheckUtils]: 37: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,038 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,038 INFO L272 TraceCheckUtils]: 42: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,039 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,039 INFO L272 TraceCheckUtils]: 47: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,040 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,043 INFO L272 TraceCheckUtils]: 55: Hoare triple {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:50,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,045 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,046 INFO L272 TraceCheckUtils]: 60: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,047 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {28358#true} {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,047 INFO L272 TraceCheckUtils]: 65: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,048 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {28358#true} {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,048 INFO L272 TraceCheckUtils]: 70: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,048 INFO L290 TraceCheckUtils]: 72: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,049 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28358#true} {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,053 INFO L290 TraceCheckUtils]: 77: Hoare triple {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,054 INFO L272 TraceCheckUtils]: 78: Hoare triple {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,054 INFO L290 TraceCheckUtils]: 79: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:50,054 INFO L290 TraceCheckUtils]: 80: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,054 INFO L290 TraceCheckUtils]: 81: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,057 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,057 INFO L272 TraceCheckUtils]: 83: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,058 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28358#true} {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #88#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,058 INFO L272 TraceCheckUtils]: 88: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,058 INFO L290 TraceCheckUtils]: 89: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:50,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,059 INFO L290 TraceCheckUtils]: 91: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,060 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #90#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,060 INFO L272 TraceCheckUtils]: 93: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,060 INFO L290 TraceCheckUtils]: 94: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:50,061 INFO L290 TraceCheckUtils]: 95: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,061 INFO L290 TraceCheckUtils]: 96: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,062 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #92#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,062 INFO L290 TraceCheckUtils]: 98: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {28668#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:58:50,065 INFO L290 TraceCheckUtils]: 99: Hoare triple {28668#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,067 INFO L290 TraceCheckUtils]: 102: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,068 INFO L290 TraceCheckUtils]: 103: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,068 INFO L272 TraceCheckUtils]: 105: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,069 INFO L290 TraceCheckUtils]: 106: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,069 INFO L290 TraceCheckUtils]: 107: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,069 INFO L290 TraceCheckUtils]: 108: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,070 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {28358#true} {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,070 INFO L272 TraceCheckUtils]: 110: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,070 INFO L290 TraceCheckUtils]: 111: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-27 12:58:50,070 INFO L290 TraceCheckUtils]: 112: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-27 12:58:50,070 INFO L290 TraceCheckUtils]: 113: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-27 12:58:50,071 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28358#true} {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,071 INFO L272 TraceCheckUtils]: 115: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-27 12:58:50,071 INFO L290 TraceCheckUtils]: 116: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:50,072 INFO L290 TraceCheckUtils]: 117: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,072 INFO L290 TraceCheckUtils]: 118: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:50,073 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:50,076 INFO L272 TraceCheckUtils]: 120: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28736#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:58:50,076 INFO L290 TraceCheckUtils]: 121: Hoare triple {28736#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28740#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:50,077 INFO L290 TraceCheckUtils]: 122: Hoare triple {28740#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28359#false} is VALID [2022-04-27 12:58:50,077 INFO L290 TraceCheckUtils]: 123: Hoare triple {28359#false} assume !false; {28359#false} is VALID [2022-04-27 12:58:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-27 12:58:50,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:00:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:00:49,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786412041] [2022-04-27 13:00:49,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:00:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430427636] [2022-04-27 13:00:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430427636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:00:49,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:00:49,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 13:00:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575280365] [2022-04-27 13:00:49,185 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:00:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-27 13:00:49,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:00:49,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:00:49,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:49,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 13:00:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:00:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 13:00:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2022-04-27 13:00:49,289 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:00:57,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:01:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:01:10,164 INFO L93 Difference]: Finished difference Result 1331 states and 1650 transitions. [2022-04-27 13:01:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:01:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-27 13:01:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:01:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:01:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2022-04-27 13:01:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:01:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2022-04-27 13:01:10,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 121 transitions. [2022-04-27 13:01:10,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:01:10,413 INFO L225 Difference]: With dead ends: 1331 [2022-04-27 13:01:10,414 INFO L226 Difference]: Without dead ends: 1329 [2022-04-27 13:01:10,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=187, Invalid=742, Unknown=1, NotChecked=0, Total=930 [2022-04-27 13:01:10,425 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:01:10,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 320 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 714 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-27 13:01:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-04-27 13:01:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-04-27 13:01:11,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:01:11,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:01:11,884 INFO L74 IsIncluded]: Start isIncluded. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:01:11,885 INFO L87 Difference]: Start difference. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:01:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:01:11,933 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-27 13:01:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1640 transitions. [2022-04-27 13:01:11,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:01:11,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:01:11,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) Second operand 1329 states. [2022-04-27 13:01:11,939 INFO L87 Difference]: Start difference. First operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) Second operand 1329 states. [2022-04-27 13:01:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:01:11,986 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-27 13:01:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1640 transitions. [2022-04-27 13:01:11,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:01:11,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:01:11,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:01:11,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:01:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:01:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1632 transitions. [2022-04-27 13:01:12,058 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1632 transitions. Word has length 124 [2022-04-27 13:01:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:01:12,059 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1632 transitions. [2022-04-27 13:01:12,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:01:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1632 transitions. [2022-04-27 13:01:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 13:01:12,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:01:12,060 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:01:12,080 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-27 13:01:12,275 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-27 13:01:12,275 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:01:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:01:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 3 times [2022-04-27 13:01:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:01:12,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459252780] [2022-04-27 13:01:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:01:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:01:12,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:01:12,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296513463] [2022-04-27 13:01:12,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:01:12,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:01:12,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:01:12,289 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-27 13:01:12,292 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-27 13:01:12,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:01:12,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:01:12,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-27 13:01:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:01:12,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:01:14,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {35437#true} call ULTIMATE.init(); {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {35437#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35437#true} {35437#true} #98#return; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {35437#true} call #t~ret8 := main(); {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {35437#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {35437#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35437#true} {35437#true} #78#return; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L272 TraceCheckUtils]: 11: Hoare triple {35437#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,058 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35437#true} {35437#true} #80#return; {35437#true} is VALID [2022-04-27 13:01:14,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {35437#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,058 INFO L272 TraceCheckUtils]: 17: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,059 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35437#true} {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,060 INFO L272 TraceCheckUtils]: 22: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,061 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35437#true} {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,063 INFO L272 TraceCheckUtils]: 32: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,064 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,064 INFO L272 TraceCheckUtils]: 37: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,065 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,066 INFO L272 TraceCheckUtils]: 42: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,067 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,067 INFO L272 TraceCheckUtils]: 47: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,068 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:14,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,071 INFO L272 TraceCheckUtils]: 59: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,073 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,073 INFO L272 TraceCheckUtils]: 64: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,073 INFO L290 TraceCheckUtils]: 67: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,074 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,074 INFO L272 TraceCheckUtils]: 69: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,074 INFO L290 TraceCheckUtils]: 71: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,075 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,075 INFO L272 TraceCheckUtils]: 74: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,076 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,077 INFO L290 TraceCheckUtils]: 79: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:01:14,077 INFO L290 TraceCheckUtils]: 80: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:01:14,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:01:14,078 INFO L272 TraceCheckUtils]: 82: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,079 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35437#true} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #86#return; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:01:14,079 INFO L272 TraceCheckUtils]: 87: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,080 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35437#true} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #88#return; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:01:14,080 INFO L272 TraceCheckUtils]: 92: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,081 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35437#true} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #90#return; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:01:14,081 INFO L272 TraceCheckUtils]: 97: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {35437#true} ~cond := #in~cond; {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:01:14,082 INFO L290 TraceCheckUtils]: 99: Hoare triple {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:14,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:14,084 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #92#return; {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,084 INFO L290 TraceCheckUtils]: 102: Hoare triple {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,085 INFO L290 TraceCheckUtils]: 103: Hoare triple {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,086 INFO L290 TraceCheckUtils]: 105: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,086 INFO L290 TraceCheckUtils]: 106: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,087 INFO L290 TraceCheckUtils]: 107: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,087 INFO L290 TraceCheckUtils]: 108: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,087 INFO L272 TraceCheckUtils]: 109: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,087 INFO L290 TraceCheckUtils]: 110: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,088 INFO L290 TraceCheckUtils]: 111: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,088 INFO L290 TraceCheckUtils]: 112: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,088 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {35437#true} {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,089 INFO L272 TraceCheckUtils]: 114: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,089 INFO L290 TraceCheckUtils]: 115: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:01:14,089 INFO L290 TraceCheckUtils]: 116: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:01:14,089 INFO L290 TraceCheckUtils]: 117: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:01:14,089 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {35437#true} {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,090 INFO L272 TraceCheckUtils]: 119: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:01:14,090 INFO L290 TraceCheckUtils]: 120: Hoare triple {35437#true} ~cond := #in~cond; {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:01:14,090 INFO L290 TraceCheckUtils]: 121: Hoare triple {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:14,091 INFO L290 TraceCheckUtils]: 122: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:14,091 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:01:14,094 INFO L272 TraceCheckUtils]: 124: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:01:14,094 INFO L290 TraceCheckUtils]: 125: Hoare triple {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:01:14,094 INFO L290 TraceCheckUtils]: 126: Hoare triple {35827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35438#false} is VALID [2022-04-27 13:01:14,094 INFO L290 TraceCheckUtils]: 127: Hoare triple {35438#false} assume !false; {35438#false} is VALID [2022-04-27 13:01:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-27 13:01:14,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:03:07,815 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (* (- 1) c_main_~s~0 c_main_~y~0)) (.cse1 (* c_main_~p~0 c_main_~x~0)) (.cse2 (* c_main_~r~0 c_main_~y~0)) (.cse4 (* (- 1) c_main_~q~0 c_main_~x~0))) (let ((.cse0 (+ c_main_~b~0 .cse3 .cse1 .cse2 .cse4))) (or (not (= (+ (* .cse0 c_main_~y~0) .cse1 .cse2) (+ c_main_~b~0 (* c_main_~yy~0 c_main_~r~0) .cse3 .cse1 .cse2 .cse4 (* c_main_~xy~0 c_main_~p~0)))) (not (= .cse0 c_main_~a~0)) (let ((.cse7 (+ c_main_~q~0 (* (- 1) c_main_~p~0))) (.cse8 (+ c_main_~s~0 (* (- 1) c_main_~r~0)))) (let ((.cse5 (* c_main_~y~0 .cse8)) (.cse6 (* .cse7 c_main_~x~0))) (= (+ (* (+ .cse5 .cse6) c_main_~y~0) .cse5 .cse6) (+ .cse5 (* c_main_~xy~0 .cse7) .cse6 (* c_main_~yy~0 .cse8)))))))) is different from true [2022-04-27 13:03:08,046 INFO L290 TraceCheckUtils]: 127: Hoare triple {35438#false} assume !false; {35438#false} is VALID [2022-04-27 13:03:08,047 INFO L290 TraceCheckUtils]: 126: Hoare triple {35827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35438#false} is VALID [2022-04-27 13:03:08,047 INFO L290 TraceCheckUtils]: 125: Hoare triple {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:08,048 INFO L272 TraceCheckUtils]: 124: Hoare triple {35843#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:03:08,048 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #90#return; {35843#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-27 13:03:08,049 INFO L290 TraceCheckUtils]: 122: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:08,049 INFO L290 TraceCheckUtils]: 121: Hoare triple {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:08,049 INFO L290 TraceCheckUtils]: 120: Hoare triple {35437#true} ~cond := #in~cond; {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:03:08,049 INFO L272 TraceCheckUtils]: 119: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:08,050 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {35437#true} {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:08,050 INFO L290 TraceCheckUtils]: 117: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:08,050 INFO L290 TraceCheckUtils]: 116: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:08,050 INFO L290 TraceCheckUtils]: 115: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:08,050 INFO L272 TraceCheckUtils]: 114: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:08,051 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {35437#true} {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:08,051 INFO L290 TraceCheckUtils]: 112: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:08,051 INFO L290 TraceCheckUtils]: 111: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:08,051 INFO L290 TraceCheckUtils]: 110: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:08,051 INFO L272 TraceCheckUtils]: 109: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:08,052 INFO L290 TraceCheckUtils]: 108: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:08,052 INFO L290 TraceCheckUtils]: 107: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:08,053 INFO L290 TraceCheckUtils]: 106: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:08,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post6 < 20);havoc #t~post6; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:08,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:03:10,055 WARN L290 TraceCheckUtils]: 103: Hoare triple {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-27 13:03:10,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,057 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #92#return; {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,057 INFO L290 TraceCheckUtils]: 100: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:10,057 INFO L290 TraceCheckUtils]: 99: Hoare triple {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:10,058 INFO L290 TraceCheckUtils]: 98: Hoare triple {35437#true} ~cond := #in~cond; {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:03:10,058 INFO L272 TraceCheckUtils]: 97: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,059 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35437#true} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #90#return; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,059 INFO L290 TraceCheckUtils]: 94: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,059 INFO L272 TraceCheckUtils]: 92: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,060 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35437#true} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #88#return; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,060 INFO L290 TraceCheckUtils]: 90: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,060 INFO L290 TraceCheckUtils]: 89: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,060 INFO L290 TraceCheckUtils]: 88: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,060 INFO L272 TraceCheckUtils]: 87: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,061 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35437#true} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #86#return; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,061 INFO L290 TraceCheckUtils]: 85: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,061 INFO L290 TraceCheckUtils]: 84: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,061 INFO L290 TraceCheckUtils]: 83: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,061 INFO L272 TraceCheckUtils]: 82: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,062 INFO L290 TraceCheckUtils]: 81: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,062 INFO L290 TraceCheckUtils]: 80: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:03:10,305 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #92#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,306 INFO L272 TraceCheckUtils]: 74: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,307 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #90#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,307 INFO L290 TraceCheckUtils]: 72: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,307 INFO L272 TraceCheckUtils]: 69: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,308 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #88#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,308 INFO L272 TraceCheckUtils]: 64: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,309 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #86#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:10,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:10,309 INFO L290 TraceCheckUtils]: 60: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:10,309 INFO L272 TraceCheckUtils]: 59: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:10,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:03:10,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(#t~post6 < 20);havoc #t~post6; {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-27 13:03:10,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-27 13:03:12,316 WARN L290 TraceCheckUtils]: 53: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is UNKNOWN [2022-04-27 13:03:12,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} assume !(~c~0 >= ~b~0); {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,318 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #92#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,319 INFO L272 TraceCheckUtils]: 47: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,319 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #90#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,320 INFO L272 TraceCheckUtils]: 42: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,320 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #88#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,321 INFO L272 TraceCheckUtils]: 37: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,321 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #86#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,322 INFO L272 TraceCheckUtils]: 32: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:03:12,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post6 < 20);havoc #t~post6; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:03:12,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:03:12,540 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35437#true} {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #84#return; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:03:12,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,541 INFO L272 TraceCheckUtils]: 22: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,542 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35437#true} {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #82#return; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:03:12,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,542 INFO L272 TraceCheckUtils]: 17: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {35437#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:03:12,544 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35437#true} {35437#true} #80#return; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {35437#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35437#true} {35437#true} #78#return; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {35437#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {35437#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {35437#true} is VALID [2022-04-27 13:03:12,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {35437#true} call #t~ret8 := main(); {35437#true} is VALID [2022-04-27 13:03:12,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35437#true} {35437#true} #98#return; {35437#true} is VALID [2022-04-27 13:03:12,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-27 13:03:12,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {35437#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35437#true} is VALID [2022-04-27 13:03:12,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {35437#true} call ULTIMATE.init(); {35437#true} is VALID [2022-04-27 13:03:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 101 proven. 43 refuted. 7 times theorem prover too weak. 366 trivial. 6 not checked. [2022-04-27 13:03:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:03:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459252780] [2022-04-27 13:03:12,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:03:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296513463] [2022-04-27 13:03:12,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296513463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:03:12,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:03:12,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-27 13:03:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273165223] [2022-04-27 13:03:12,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:03:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-04-27 13:03:12,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:03:12,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:03:16,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 138 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:03:16,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 13:03:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:03:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 13:03:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=324, Unknown=3, NotChecked=38, Total=462 [2022-04-27 13:03:16,939 INFO L87 Difference]: Start difference. First operand 1321 states and 1632 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:03:36,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:03:51,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:03:56,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:19,414 WARN L232 SmtUtils]: Spent 22.32s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:04:21,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:22,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:27,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:29,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:31,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:33,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:37,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-27 13:04:40,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:53,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:55,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:04:59,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:05:07,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:05:11,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:05:13,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:05:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:17,588 INFO L93 Difference]: Finished difference Result 1565 states and 1957 transitions. [2022-04-27 13:05:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 13:05:17,589 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-04-27 13:05:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:05:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2022-04-27 13:05:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:05:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2022-04-27 13:05:17,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 172 transitions. [2022-04-27 13:05:23,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 170 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:23,593 INFO L225 Difference]: With dead ends: 1565 [2022-04-27 13:05:23,593 INFO L226 Difference]: Without dead ends: 1549 [2022-04-27 13:05:23,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=245, Invalid=746, Unknown=5, NotChecked=60, Total=1056 [2022-04-27 13:05:23,595 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 138 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 185 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:23,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 412 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 757 Invalid, 14 Unknown, 123 Unchecked, 39.0s Time] [2022-04-27 13:05:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2022-04-27 13:05:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1481. [2022-04-27 13:05:25,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:25,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1549 states. Second operand has 1481 states, 950 states have (on average 1.1589473684210527) internal successors, (1101), 954 states have internal predecessors, (1101), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:25,364 INFO L74 IsIncluded]: Start isIncluded. First operand 1549 states. Second operand has 1481 states, 950 states have (on average 1.1589473684210527) internal successors, (1101), 954 states have internal predecessors, (1101), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:25,365 INFO L87 Difference]: Start difference. First operand 1549 states. Second operand has 1481 states, 950 states have (on average 1.1589473684210527) internal successors, (1101), 954 states have internal predecessors, (1101), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:25,449 INFO L93 Difference]: Finished difference Result 1549 states and 1934 transitions. [2022-04-27 13:05:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1934 transitions. [2022-04-27 13:05:25,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:25,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:25,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 1481 states, 950 states have (on average 1.1589473684210527) internal successors, (1101), 954 states have internal predecessors, (1101), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) Second operand 1549 states. [2022-04-27 13:05:25,454 INFO L87 Difference]: Start difference. First operand has 1481 states, 950 states have (on average 1.1589473684210527) internal successors, (1101), 954 states have internal predecessors, (1101), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) Second operand 1549 states. [2022-04-27 13:05:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:25,528 INFO L93 Difference]: Finished difference Result 1549 states and 1934 transitions. [2022-04-27 13:05:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1934 transitions. [2022-04-27 13:05:25,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:25,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:25,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:25,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 950 states have (on average 1.1589473684210527) internal successors, (1101), 954 states have internal predecessors, (1101), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1848 transitions. [2022-04-27 13:05:25,631 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1848 transitions. Word has length 128 [2022-04-27 13:05:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:25,632 INFO L495 AbstractCegarLoop]: Abstraction has 1481 states and 1848 transitions. [2022-04-27 13:05:25,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:05:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1848 transitions. [2022-04-27 13:05:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-27 13:05:25,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:25,633 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:25,650 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-27 13:05:25,847 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-27 13:05:25,847 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 1 times [2022-04-27 13:05:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:25,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416839315] [2022-04-27 13:05:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:25,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:25,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015707718] [2022-04-27 13:05:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:25,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:25,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:25,860 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-27 13:05:25,860 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-27 13:05:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:25,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:05:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:25,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:26,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2022-04-27 13:05:26,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {43788#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {43796#(<= ~counter~0 0)} assume true; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43796#(<= ~counter~0 0)} {43788#true} #98#return; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {43796#(<= ~counter~0 0)} call #t~ret8 := main(); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {43796#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {43796#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {43796#(<= ~counter~0 0)} ~cond := #in~cond; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {43796#(<= ~counter~0 0)} assume !(0 == ~cond); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {43796#(<= ~counter~0 0)} assume true; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43796#(<= ~counter~0 0)} {43796#(<= ~counter~0 0)} #78#return; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,451 INFO L272 TraceCheckUtils]: 11: Hoare triple {43796#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {43796#(<= ~counter~0 0)} ~cond := #in~cond; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {43796#(<= ~counter~0 0)} assume !(0 == ~cond); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {43796#(<= ~counter~0 0)} assume true; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,452 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43796#(<= ~counter~0 0)} {43796#(<= ~counter~0 0)} #80#return; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {43796#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,453 INFO L272 TraceCheckUtils]: 17: Hoare triple {43796#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {43796#(<= ~counter~0 0)} ~cond := #in~cond; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {43796#(<= ~counter~0 0)} assume !(0 == ~cond); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {43796#(<= ~counter~0 0)} assume true; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,454 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43796#(<= ~counter~0 0)} {43796#(<= ~counter~0 0)} #82#return; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,454 INFO L272 TraceCheckUtils]: 22: Hoare triple {43796#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {43796#(<= ~counter~0 0)} ~cond := #in~cond; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {43796#(<= ~counter~0 0)} assume !(0 == ~cond); {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {43796#(<= ~counter~0 0)} assume true; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,455 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43796#(<= ~counter~0 0)} {43796#(<= ~counter~0 0)} #84#return; {43796#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:26,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {43796#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43875#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:26,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {43875#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {43875#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:26,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {43875#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {43875#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:26,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {43875#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {43885#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,458 INFO L272 TraceCheckUtils]: 32: Hoare triple {43885#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {43885#(<= ~counter~0 2)} ~cond := #in~cond; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {43885#(<= ~counter~0 2)} assume !(0 == ~cond); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {43885#(<= ~counter~0 2)} assume true; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,459 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {43885#(<= ~counter~0 2)} {43885#(<= ~counter~0 2)} #86#return; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,460 INFO L272 TraceCheckUtils]: 37: Hoare triple {43885#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {43885#(<= ~counter~0 2)} ~cond := #in~cond; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {43885#(<= ~counter~0 2)} assume !(0 == ~cond); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {43885#(<= ~counter~0 2)} assume true; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,461 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {43885#(<= ~counter~0 2)} {43885#(<= ~counter~0 2)} #88#return; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,462 INFO L272 TraceCheckUtils]: 42: Hoare triple {43885#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {43885#(<= ~counter~0 2)} ~cond := #in~cond; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {43885#(<= ~counter~0 2)} assume !(0 == ~cond); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {43885#(<= ~counter~0 2)} assume true; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,463 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {43885#(<= ~counter~0 2)} {43885#(<= ~counter~0 2)} #90#return; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,463 INFO L272 TraceCheckUtils]: 47: Hoare triple {43885#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {43885#(<= ~counter~0 2)} ~cond := #in~cond; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {43885#(<= ~counter~0 2)} assume !(0 == ~cond); {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {43885#(<= ~counter~0 2)} assume true; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,465 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {43885#(<= ~counter~0 2)} {43885#(<= ~counter~0 2)} #92#return; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {43885#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {43885#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:26,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {43885#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {43955#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,466 INFO L272 TraceCheckUtils]: 55: Hoare triple {43955#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {43955#(<= ~counter~0 3)} ~cond := #in~cond; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {43955#(<= ~counter~0 3)} assume !(0 == ~cond); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {43955#(<= ~counter~0 3)} assume true; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,468 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {43955#(<= ~counter~0 3)} {43955#(<= ~counter~0 3)} #86#return; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,468 INFO L272 TraceCheckUtils]: 60: Hoare triple {43955#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {43955#(<= ~counter~0 3)} ~cond := #in~cond; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,469 INFO L290 TraceCheckUtils]: 62: Hoare triple {43955#(<= ~counter~0 3)} assume !(0 == ~cond); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {43955#(<= ~counter~0 3)} assume true; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,469 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {43955#(<= ~counter~0 3)} {43955#(<= ~counter~0 3)} #88#return; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,470 INFO L272 TraceCheckUtils]: 65: Hoare triple {43955#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,470 INFO L290 TraceCheckUtils]: 66: Hoare triple {43955#(<= ~counter~0 3)} ~cond := #in~cond; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {43955#(<= ~counter~0 3)} assume !(0 == ~cond); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,471 INFO L290 TraceCheckUtils]: 68: Hoare triple {43955#(<= ~counter~0 3)} assume true; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,471 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {43955#(<= ~counter~0 3)} {43955#(<= ~counter~0 3)} #90#return; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,472 INFO L272 TraceCheckUtils]: 70: Hoare triple {43955#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {43955#(<= ~counter~0 3)} ~cond := #in~cond; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {43955#(<= ~counter~0 3)} assume !(0 == ~cond); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {43955#(<= ~counter~0 3)} assume true; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,473 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {43955#(<= ~counter~0 3)} {43955#(<= ~counter~0 3)} #92#return; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {43955#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {43955#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {43955#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:26,474 INFO L290 TraceCheckUtils]: 77: Hoare triple {43955#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44028#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:26,475 INFO L290 TraceCheckUtils]: 78: Hoare triple {44028#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {44028#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:26,475 INFO L290 TraceCheckUtils]: 79: Hoare triple {44028#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {44028#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:26,475 INFO L290 TraceCheckUtils]: 80: Hoare triple {44028#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {44038#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,476 INFO L272 TraceCheckUtils]: 82: Hoare triple {44038#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {44038#(<= ~counter~0 5)} ~cond := #in~cond; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {44038#(<= ~counter~0 5)} assume !(0 == ~cond); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {44038#(<= ~counter~0 5)} assume true; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,477 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44038#(<= ~counter~0 5)} {44038#(<= ~counter~0 5)} #86#return; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,478 INFO L272 TraceCheckUtils]: 87: Hoare triple {44038#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {44038#(<= ~counter~0 5)} ~cond := #in~cond; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {44038#(<= ~counter~0 5)} assume !(0 == ~cond); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,479 INFO L290 TraceCheckUtils]: 90: Hoare triple {44038#(<= ~counter~0 5)} assume true; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,479 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44038#(<= ~counter~0 5)} {44038#(<= ~counter~0 5)} #88#return; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,480 INFO L272 TraceCheckUtils]: 92: Hoare triple {44038#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {44038#(<= ~counter~0 5)} ~cond := #in~cond; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {44038#(<= ~counter~0 5)} assume !(0 == ~cond); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,481 INFO L290 TraceCheckUtils]: 95: Hoare triple {44038#(<= ~counter~0 5)} assume true; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,481 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {44038#(<= ~counter~0 5)} {44038#(<= ~counter~0 5)} #90#return; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,482 INFO L272 TraceCheckUtils]: 97: Hoare triple {44038#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,482 INFO L290 TraceCheckUtils]: 98: Hoare triple {44038#(<= ~counter~0 5)} ~cond := #in~cond; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,482 INFO L290 TraceCheckUtils]: 99: Hoare triple {44038#(<= ~counter~0 5)} assume !(0 == ~cond); {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,483 INFO L290 TraceCheckUtils]: 100: Hoare triple {44038#(<= ~counter~0 5)} assume true; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,483 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {44038#(<= ~counter~0 5)} {44038#(<= ~counter~0 5)} #92#return; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,483 INFO L290 TraceCheckUtils]: 102: Hoare triple {44038#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {44038#(<= ~counter~0 5)} is VALID [2022-04-27 13:05:26,484 INFO L290 TraceCheckUtils]: 103: Hoare triple {44038#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,484 INFO L290 TraceCheckUtils]: 104: Hoare triple {44108#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,485 INFO L272 TraceCheckUtils]: 105: Hoare triple {44108#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,485 INFO L290 TraceCheckUtils]: 106: Hoare triple {44108#(<= ~counter~0 6)} ~cond := #in~cond; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,485 INFO L290 TraceCheckUtils]: 107: Hoare triple {44108#(<= ~counter~0 6)} assume !(0 == ~cond); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,485 INFO L290 TraceCheckUtils]: 108: Hoare triple {44108#(<= ~counter~0 6)} assume true; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,486 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {44108#(<= ~counter~0 6)} {44108#(<= ~counter~0 6)} #86#return; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,486 INFO L272 TraceCheckUtils]: 110: Hoare triple {44108#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,487 INFO L290 TraceCheckUtils]: 111: Hoare triple {44108#(<= ~counter~0 6)} ~cond := #in~cond; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,487 INFO L290 TraceCheckUtils]: 112: Hoare triple {44108#(<= ~counter~0 6)} assume !(0 == ~cond); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,487 INFO L290 TraceCheckUtils]: 113: Hoare triple {44108#(<= ~counter~0 6)} assume true; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,488 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {44108#(<= ~counter~0 6)} {44108#(<= ~counter~0 6)} #88#return; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,488 INFO L272 TraceCheckUtils]: 115: Hoare triple {44108#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,489 INFO L290 TraceCheckUtils]: 116: Hoare triple {44108#(<= ~counter~0 6)} ~cond := #in~cond; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,489 INFO L290 TraceCheckUtils]: 117: Hoare triple {44108#(<= ~counter~0 6)} assume !(0 == ~cond); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,489 INFO L290 TraceCheckUtils]: 118: Hoare triple {44108#(<= ~counter~0 6)} assume true; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,490 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {44108#(<= ~counter~0 6)} {44108#(<= ~counter~0 6)} #90#return; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,490 INFO L272 TraceCheckUtils]: 120: Hoare triple {44108#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,491 INFO L290 TraceCheckUtils]: 121: Hoare triple {44108#(<= ~counter~0 6)} ~cond := #in~cond; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,491 INFO L290 TraceCheckUtils]: 122: Hoare triple {44108#(<= ~counter~0 6)} assume !(0 == ~cond); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,491 INFO L290 TraceCheckUtils]: 123: Hoare triple {44108#(<= ~counter~0 6)} assume true; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,492 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {44108#(<= ~counter~0 6)} {44108#(<= ~counter~0 6)} #92#return; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,492 INFO L290 TraceCheckUtils]: 125: Hoare triple {44108#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,492 INFO L290 TraceCheckUtils]: 126: Hoare triple {44108#(<= ~counter~0 6)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {44108#(<= ~counter~0 6)} is VALID [2022-04-27 13:05:26,493 INFO L290 TraceCheckUtils]: 127: Hoare triple {44108#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44181#(<= |main_#t~post6| 6)} is VALID [2022-04-27 13:05:26,493 INFO L290 TraceCheckUtils]: 128: Hoare triple {44181#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {43789#false} is VALID [2022-04-27 13:05:26,493 INFO L272 TraceCheckUtils]: 129: Hoare triple {43789#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43789#false} is VALID [2022-04-27 13:05:26,493 INFO L290 TraceCheckUtils]: 130: Hoare triple {43789#false} ~cond := #in~cond; {43789#false} is VALID [2022-04-27 13:05:26,493 INFO L290 TraceCheckUtils]: 131: Hoare triple {43789#false} assume 0 == ~cond; {43789#false} is VALID [2022-04-27 13:05:26,493 INFO L290 TraceCheckUtils]: 132: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2022-04-27 13:05:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-27 13:05:26,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:27,018 INFO L290 TraceCheckUtils]: 132: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2022-04-27 13:05:27,018 INFO L290 TraceCheckUtils]: 131: Hoare triple {43789#false} assume 0 == ~cond; {43789#false} is VALID [2022-04-27 13:05:27,018 INFO L290 TraceCheckUtils]: 130: Hoare triple {43789#false} ~cond := #in~cond; {43789#false} is VALID [2022-04-27 13:05:27,019 INFO L272 TraceCheckUtils]: 129: Hoare triple {43789#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43789#false} is VALID [2022-04-27 13:05:27,019 INFO L290 TraceCheckUtils]: 128: Hoare triple {44209#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {43789#false} is VALID [2022-04-27 13:05:27,019 INFO L290 TraceCheckUtils]: 127: Hoare triple {44213#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44209#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:05:27,020 INFO L290 TraceCheckUtils]: 126: Hoare triple {44213#(< ~counter~0 20)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,020 INFO L290 TraceCheckUtils]: 125: Hoare triple {44213#(< ~counter~0 20)} assume !(~c~0 >= ~b~0); {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,021 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {43788#true} {44213#(< ~counter~0 20)} #92#return; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,021 INFO L290 TraceCheckUtils]: 123: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,021 INFO L290 TraceCheckUtils]: 122: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,021 INFO L290 TraceCheckUtils]: 121: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,021 INFO L272 TraceCheckUtils]: 120: Hoare triple {44213#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,021 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {43788#true} {44213#(< ~counter~0 20)} #90#return; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,022 INFO L290 TraceCheckUtils]: 118: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,022 INFO L290 TraceCheckUtils]: 117: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,022 INFO L272 TraceCheckUtils]: 115: Hoare triple {44213#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,022 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {43788#true} {44213#(< ~counter~0 20)} #88#return; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,022 INFO L290 TraceCheckUtils]: 113: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,022 INFO L290 TraceCheckUtils]: 112: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,023 INFO L290 TraceCheckUtils]: 111: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,023 INFO L272 TraceCheckUtils]: 110: Hoare triple {44213#(< ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,023 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {43788#true} {44213#(< ~counter~0 20)} #86#return; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,023 INFO L290 TraceCheckUtils]: 108: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,023 INFO L290 TraceCheckUtils]: 107: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,023 INFO L290 TraceCheckUtils]: 106: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,024 INFO L272 TraceCheckUtils]: 105: Hoare triple {44213#(< ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,024 INFO L290 TraceCheckUtils]: 104: Hoare triple {44213#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,025 INFO L290 TraceCheckUtils]: 103: Hoare triple {44286#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44213#(< ~counter~0 20)} is VALID [2022-04-27 13:05:27,025 INFO L290 TraceCheckUtils]: 102: Hoare triple {44286#(< ~counter~0 19)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,026 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {43788#true} {44286#(< ~counter~0 19)} #92#return; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,026 INFO L290 TraceCheckUtils]: 100: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,026 INFO L290 TraceCheckUtils]: 99: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,026 INFO L272 TraceCheckUtils]: 97: Hoare triple {44286#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,026 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {43788#true} {44286#(< ~counter~0 19)} #90#return; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,027 INFO L290 TraceCheckUtils]: 95: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,027 INFO L290 TraceCheckUtils]: 93: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,027 INFO L272 TraceCheckUtils]: 92: Hoare triple {44286#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,027 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {43788#true} {44286#(< ~counter~0 19)} #88#return; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,027 INFO L290 TraceCheckUtils]: 90: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,027 INFO L290 TraceCheckUtils]: 89: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,028 INFO L290 TraceCheckUtils]: 88: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,028 INFO L272 TraceCheckUtils]: 87: Hoare triple {44286#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,028 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {43788#true} {44286#(< ~counter~0 19)} #86#return; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,028 INFO L290 TraceCheckUtils]: 83: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,028 INFO L272 TraceCheckUtils]: 82: Hoare triple {44286#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {44286#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,029 INFO L290 TraceCheckUtils]: 80: Hoare triple {44356#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44286#(< ~counter~0 19)} is VALID [2022-04-27 13:05:27,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {44356#(< ~counter~0 18)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {44356#(< ~counter~0 18)} is VALID [2022-04-27 13:05:27,030 INFO L290 TraceCheckUtils]: 78: Hoare triple {44356#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {44356#(< ~counter~0 18)} is VALID [2022-04-27 13:05:27,030 INFO L290 TraceCheckUtils]: 77: Hoare triple {44366#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44356#(< ~counter~0 18)} is VALID [2022-04-27 13:05:27,030 INFO L290 TraceCheckUtils]: 76: Hoare triple {44366#(< ~counter~0 17)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {44366#(< ~counter~0 17)} assume !(~c~0 >= ~b~0); {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,031 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {43788#true} {44366#(< ~counter~0 17)} #92#return; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,031 INFO L290 TraceCheckUtils]: 73: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,032 INFO L290 TraceCheckUtils]: 72: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,032 INFO L290 TraceCheckUtils]: 71: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,032 INFO L272 TraceCheckUtils]: 70: Hoare triple {44366#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,032 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {43788#true} {44366#(< ~counter~0 17)} #90#return; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,032 INFO L290 TraceCheckUtils]: 68: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,032 INFO L290 TraceCheckUtils]: 67: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,032 INFO L290 TraceCheckUtils]: 66: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,033 INFO L272 TraceCheckUtils]: 65: Hoare triple {44366#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,033 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {43788#true} {44366#(< ~counter~0 17)} #88#return; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,033 INFO L272 TraceCheckUtils]: 60: Hoare triple {44366#(< ~counter~0 17)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,034 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {43788#true} {44366#(< ~counter~0 17)} #86#return; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,034 INFO L272 TraceCheckUtils]: 55: Hoare triple {44366#(< ~counter~0 17)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {44366#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {44439#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44366#(< ~counter~0 17)} is VALID [2022-04-27 13:05:27,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {44439#(< ~counter~0 16)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,036 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {43788#true} {44439#(< ~counter~0 16)} #92#return; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,036 INFO L272 TraceCheckUtils]: 47: Hoare triple {44439#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,037 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {43788#true} {44439#(< ~counter~0 16)} #90#return; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,037 INFO L272 TraceCheckUtils]: 42: Hoare triple {44439#(< ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,038 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {43788#true} {44439#(< ~counter~0 16)} #88#return; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,038 INFO L272 TraceCheckUtils]: 37: Hoare triple {44439#(< ~counter~0 16)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,038 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {43788#true} {44439#(< ~counter~0 16)} #86#return; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,039 INFO L272 TraceCheckUtils]: 32: Hoare triple {44439#(< ~counter~0 16)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {44439#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {44509#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44439#(< ~counter~0 16)} is VALID [2022-04-27 13:05:27,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {44509#(< ~counter~0 15)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {44509#(< ~counter~0 15)} is VALID [2022-04-27 13:05:27,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {44509#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {44509#(< ~counter~0 15)} is VALID [2022-04-27 13:05:27,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {44519#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44509#(< ~counter~0 15)} is VALID [2022-04-27 13:05:27,042 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43788#true} {44519#(< ~counter~0 14)} #84#return; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,042 INFO L272 TraceCheckUtils]: 22: Hoare triple {44519#(< ~counter~0 14)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,042 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43788#true} {44519#(< ~counter~0 14)} #82#return; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,043 INFO L272 TraceCheckUtils]: 17: Hoare triple {44519#(< ~counter~0 14)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {44519#(< ~counter~0 14)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43788#true} {44519#(< ~counter~0 14)} #80#return; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {44519#(< ~counter~0 14)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43788#true} {44519#(< ~counter~0 14)} #78#return; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {43788#true} assume true; {43788#true} is VALID [2022-04-27 13:05:27,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {43788#true} assume !(0 == ~cond); {43788#true} is VALID [2022-04-27 13:05:27,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {43788#true} ~cond := #in~cond; {43788#true} is VALID [2022-04-27 13:05:27,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {44519#(< ~counter~0 14)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43788#true} is VALID [2022-04-27 13:05:27,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {44519#(< ~counter~0 14)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {44519#(< ~counter~0 14)} call #t~ret8 := main(); {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44519#(< ~counter~0 14)} {43788#true} #98#return; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {44519#(< ~counter~0 14)} assume true; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {43788#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {44519#(< ~counter~0 14)} is VALID [2022-04-27 13:05:27,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2022-04-27 13:05:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-27 13:05:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:27,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416839315] [2022-04-27 13:05:27,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:27,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015707718] [2022-04-27 13:05:27,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015707718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:27,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:27,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 13:05:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762298634] [2022-04-27 13:05:27,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:27,048 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-04-27 13:05:27,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:27,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-27 13:05:27,179 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-27 13:05:27,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:05:27,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:05:27,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:05:27,180 INFO L87 Difference]: Start difference. First operand 1481 states and 1848 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-27 13:05:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:30,254 INFO L93 Difference]: Finished difference Result 1535 states and 1898 transitions. [2022-04-27 13:05:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 13:05:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-04-27 13:05:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-27 13:05:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 316 transitions. [2022-04-27 13:05:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-27 13:05:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 316 transitions. [2022-04-27 13:05:30,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 316 transitions. [2022-04-27 13:05:30,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:30,611 INFO L225 Difference]: With dead ends: 1535 [2022-04-27 13:05:30,611 INFO L226 Difference]: Without dead ends: 1525 [2022-04-27 13:05:30,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-04-27 13:05:30,613 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 268 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:30,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 438 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 13:05:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-04-27 13:05:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1493. [2022-04-27 13:05:32,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:32,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1525 states. Second operand has 1493 states, 962 states have (on average 1.135135135135135) internal successors, (1092), 966 states have internal predecessors, (1092), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:32,268 INFO L74 IsIncluded]: Start isIncluded. First operand 1525 states. Second operand has 1493 states, 962 states have (on average 1.135135135135135) internal successors, (1092), 966 states have internal predecessors, (1092), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:32,269 INFO L87 Difference]: Start difference. First operand 1525 states. Second operand has 1493 states, 962 states have (on average 1.135135135135135) internal successors, (1092), 966 states have internal predecessors, (1092), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:32,332 INFO L93 Difference]: Finished difference Result 1525 states and 1864 transitions. [2022-04-27 13:05:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1864 transitions. [2022-04-27 13:05:32,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:32,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:32,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 1493 states, 962 states have (on average 1.135135135135135) internal successors, (1092), 966 states have internal predecessors, (1092), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) Second operand 1525 states. [2022-04-27 13:05:32,338 INFO L87 Difference]: Start difference. First operand has 1493 states, 962 states have (on average 1.135135135135135) internal successors, (1092), 966 states have internal predecessors, (1092), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) Second operand 1525 states. [2022-04-27 13:05:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:32,405 INFO L93 Difference]: Finished difference Result 1525 states and 1864 transitions. [2022-04-27 13:05:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1864 transitions. [2022-04-27 13:05:32,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:32,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:32,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:32,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 962 states have (on average 1.135135135135135) internal successors, (1092), 966 states have internal predecessors, (1092), 375 states have call successors, (375), 157 states have call predecessors, (375), 155 states have return successors, (372), 369 states have call predecessors, (372), 372 states have call successors, (372) [2022-04-27 13:05:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1839 transitions. [2022-04-27 13:05:32,501 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1839 transitions. Word has length 133 [2022-04-27 13:05:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:32,502 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1839 transitions. [2022-04-27 13:05:32,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-27 13:05:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1839 transitions. [2022-04-27 13:05:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 13:05:32,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:32,503 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-27 13:05:32,522 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-27 13:05:32,722 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-27 13:05:32,722 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 2 times [2022-04-27 13:05:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:32,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996636679] [2022-04-27 13:05:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:32,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255274251] [2022-04-27 13:05:32,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:05:32,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:32,736 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-27 13:05:32,736 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-27 13:05:32,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:05:32,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:05:32,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-27 13:05:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:32,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:35,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {52093#true} call ULTIMATE.init(); {52093#true} is VALID [2022-04-27 13:05:35,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {52093#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {52093#true} is VALID [2022-04-27 13:05:35,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:35,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52093#true} {52093#true} #98#return; {52093#true} is VALID [2022-04-27 13:05:35,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {52093#true} call #t~ret8 := main(); {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {52093#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {52093#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52093#true} {52093#true} #78#return; {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L272 TraceCheckUtils]: 11: Hoare triple {52093#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:35,993 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52093#true} {52093#true} #80#return; {52093#true} is VALID [2022-04-27 13:05:35,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {52093#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,994 INFO L272 TraceCheckUtils]: 17: Hoare triple {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:35,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:35,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:35,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:35,995 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {52093#true} {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,995 INFO L272 TraceCheckUtils]: 22: Hoare triple {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:35,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:35,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:35,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:35,996 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {52093#true} {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= 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; {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {52146#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:35,999 INFO L272 TraceCheckUtils]: 32: Hoare triple {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:35,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:35,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:35,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,000 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {52093#true} {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:36,000 INFO L272 TraceCheckUtils]: 37: Hoare triple {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {52093#true} ~cond := #in~cond; {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:36,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,002 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} {52186#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:36,002 INFO L272 TraceCheckUtils]: 42: Hoare triple {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {52093#true} ~cond := #in~cond; {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:36,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,004 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:36,004 INFO L272 TraceCheckUtils]: 47: Hoare triple {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,007 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {52093#true} {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:36,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {52225#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {52259#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:36,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {52259#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {52263#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {52263#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52263#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {52263#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {52263#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {52263#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,010 INFO L272 TraceCheckUtils]: 59: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,011 INFO L290 TraceCheckUtils]: 62: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,011 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52093#true} {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,011 INFO L272 TraceCheckUtils]: 64: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,012 INFO L290 TraceCheckUtils]: 66: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,012 INFO L290 TraceCheckUtils]: 67: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,012 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {52093#true} {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,013 INFO L272 TraceCheckUtils]: 69: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,013 INFO L290 TraceCheckUtils]: 70: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,013 INFO L290 TraceCheckUtils]: 71: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,013 INFO L290 TraceCheckUtils]: 72: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,018 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {52093#true} {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #90#return; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,018 INFO L272 TraceCheckUtils]: 74: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,019 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {52093#true} {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #92#return; {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,021 INFO L290 TraceCheckUtils]: 79: Hoare triple {52273#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,022 INFO L290 TraceCheckUtils]: 81: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,022 INFO L272 TraceCheckUtils]: 82: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,022 INFO L290 TraceCheckUtils]: 83: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,023 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52093#true} {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,024 INFO L272 TraceCheckUtils]: 87: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,024 INFO L290 TraceCheckUtils]: 88: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,024 INFO L290 TraceCheckUtils]: 89: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,024 INFO L290 TraceCheckUtils]: 90: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,025 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52093#true} {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,025 INFO L272 TraceCheckUtils]: 92: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,025 INFO L290 TraceCheckUtils]: 93: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,025 INFO L290 TraceCheckUtils]: 94: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,025 INFO L290 TraceCheckUtils]: 95: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,026 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {52093#true} {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #90#return; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,026 INFO L272 TraceCheckUtils]: 97: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,026 INFO L290 TraceCheckUtils]: 99: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,026 INFO L290 TraceCheckUtils]: 100: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,027 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {52093#true} {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #92#return; {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,029 INFO L290 TraceCheckUtils]: 102: Hoare triple {52343#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,029 INFO L290 TraceCheckUtils]: 103: Hoare triple {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,030 INFO L290 TraceCheckUtils]: 104: Hoare triple {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,030 INFO L272 TraceCheckUtils]: 105: Hoare triple {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,030 INFO L290 TraceCheckUtils]: 106: Hoare triple {52093#true} ~cond := #in~cond; {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:36,030 INFO L290 TraceCheckUtils]: 107: Hoare triple {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,034 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} {52413#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} #86#return; {52435#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,034 INFO L272 TraceCheckUtils]: 110: Hoare triple {52435#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,034 INFO L290 TraceCheckUtils]: 111: Hoare triple {52093#true} ~cond := #in~cond; {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:36,035 INFO L290 TraceCheckUtils]: 112: Hoare triple {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,035 INFO L290 TraceCheckUtils]: 113: Hoare triple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,037 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} {52435#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 1))} #88#return; {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,037 INFO L272 TraceCheckUtils]: 115: Hoare triple {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,037 INFO L290 TraceCheckUtils]: 116: Hoare triple {52093#true} ~cond := #in~cond; {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:36,038 INFO L290 TraceCheckUtils]: 117: Hoare triple {52214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,038 INFO L290 TraceCheckUtils]: 118: Hoare triple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:36,039 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {52218#(not (= |__VERIFIER_assert_#in~cond| 0))} {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} #90#return; {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,039 INFO L272 TraceCheckUtils]: 120: Hoare triple {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {52093#true} is VALID [2022-04-27 13:05:36,039 INFO L290 TraceCheckUtils]: 121: Hoare triple {52093#true} ~cond := #in~cond; {52093#true} is VALID [2022-04-27 13:05:36,039 INFO L290 TraceCheckUtils]: 122: Hoare triple {52093#true} assume !(0 == ~cond); {52093#true} is VALID [2022-04-27 13:05:36,039 INFO L290 TraceCheckUtils]: 123: Hoare triple {52093#true} assume true; {52093#true} is VALID [2022-04-27 13:05:36,040 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {52093#true} {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} #92#return; {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,040 INFO L290 TraceCheckUtils]: 125: Hoare triple {52451#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {52485#(and (= main_~s~0 0) (= (* main_~x~0 2) (* main_~k~0 main_~x~0)) (= main_~p~0 0) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (< main_~c~0 main_~x~0) (< main_~x~0 (+ main_~c~0 (* main_~k~0 main_~x~0))) (= main_~q~0 1))} is VALID [2022-04-27 13:05:36,043 INFO L290 TraceCheckUtils]: 126: Hoare triple {52485#(and (= main_~s~0 0) (= (* main_~x~0 2) (* main_~k~0 main_~x~0)) (= main_~p~0 0) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (< main_~c~0 main_~x~0) (< main_~x~0 (+ main_~c~0 (* main_~k~0 main_~x~0))) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {52489#(and (= (* main_~x~0 2) (* main_~x~0 (* (- 1) main_~q~0))) (< (+ (* main_~q~0 main_~x~0) main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} is VALID [2022-04-27 13:05:36,043 INFO L290 TraceCheckUtils]: 127: Hoare triple {52489#(and (= (* main_~x~0 2) (* main_~x~0 (* (- 1) main_~q~0))) (< (+ (* main_~q~0 main_~x~0) main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52489#(and (= (* main_~x~0 2) (* main_~x~0 (* (- 1) main_~q~0))) (< (+ (* main_~q~0 main_~x~0) main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} is VALID [2022-04-27 13:05:36,044 INFO L290 TraceCheckUtils]: 128: Hoare triple {52489#(and (= (* main_~x~0 2) (* main_~x~0 (* (- 1) main_~q~0))) (< (+ (* main_~q~0 main_~x~0) main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {52489#(and (= (* main_~x~0 2) (* main_~x~0 (* (- 1) main_~q~0))) (< (+ (* main_~q~0 main_~x~0) main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} is VALID [2022-04-27 13:05:36,044 INFO L290 TraceCheckUtils]: 129: Hoare triple {52489#(and (= (* main_~x~0 2) (* main_~x~0 (* (- 1) main_~q~0))) (< (+ (* main_~q~0 main_~x~0) main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} assume !(0 != ~b~0); {52499#(and (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ (* main_~q~0 main_~x~0) main_~y~0) 0) (= (+ (* main_~x~0 2) (* main_~q~0 main_~x~0)) 0))} is VALID [2022-04-27 13:05:36,045 INFO L272 TraceCheckUtils]: 130: Hoare triple {52499#(and (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ (* main_~q~0 main_~x~0) main_~y~0) 0) (= (+ (* main_~x~0 2) (* main_~q~0 main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {52503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:36,045 INFO L290 TraceCheckUtils]: 131: Hoare triple {52503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:36,046 INFO L290 TraceCheckUtils]: 132: Hoare triple {52507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52094#false} is VALID [2022-04-27 13:05:36,046 INFO L290 TraceCheckUtils]: 133: Hoare triple {52094#false} assume !false; {52094#false} is VALID [2022-04-27 13:05:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-04-27 13:05:36,047 INFO L328 TraceCheckSpWp]: Computing backward predicates...