/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/egcd3-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:04:39,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:04:39,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:04:39,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:04:39,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:04:39,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:04:39,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:04:39,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:04:39,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:04:39,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:04:39,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:04:39,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:04:39,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:04:39,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:04:39,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:04:39,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:04:39,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:04:39,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:04:39,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:04:39,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:04:39,524 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:04:39,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:04:39,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:04:39,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:04:39,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:04:39,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:04:39,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:04:39,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:04:39,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:04:39,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:04:39,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:04:39,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:04:39,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:04:39,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:04:39,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:04:39,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:04:39,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:04:39,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:04:39,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:04:39,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:04:39,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:04:39,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:04:39,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:04:39,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:04:39,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:04:39,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:04:39,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:04:39,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:04:39,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:04:39,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:04:39,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:04:39,577 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:04:39,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:04:39,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:04:39,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:04:39,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:04:39,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:04:39,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:04:39,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:04:39,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:04:39,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:04:39,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:04:39,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:04:39,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:04:39,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:04:39,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:04:39,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:04:39,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:04:39,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:04:39,785 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:04:39,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound20.c [2022-04-27 13:04:39,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbad8833/e69dba11277d44ad8de9d832fa40b4e3/FLAGde3e0f0bf [2022-04-27 13:04:40,168 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:04:40,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound20.c [2022-04-27 13:04:40,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbad8833/e69dba11277d44ad8de9d832fa40b4e3/FLAGde3e0f0bf [2022-04-27 13:04:40,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbad8833/e69dba11277d44ad8de9d832fa40b4e3 [2022-04-27 13:04:40,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:04:40,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:04:40,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:04:40,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:04:40,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:04:40,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e58fcc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40, skipping insertion in model container [2022-04-27 13:04:40,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:04:40,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:04:40,765 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/egcd3-ll_unwindbound20.c[490,503] [2022-04-27 13:04:40,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:04:40,800 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:04:40,811 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/egcd3-ll_unwindbound20.c[490,503] [2022-04-27 13:04:40,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:04:40,831 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:04:40,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40 WrapperNode [2022-04-27 13:04:40,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:04:40,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:04:40,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:04:40,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:04:40,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:04:40,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:04:40,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:04:40,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:04:40,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (1/1) ... [2022-04-27 13:04:40,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:04:40,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:40,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:04:40,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:04:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:04:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:04:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:04:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:04:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:04:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:04:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:04:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:04:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:04:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:04:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:04:40,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:04:40,978 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:04:40,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:04:41,129 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:04:41,135 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:04:41,135 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:04:41,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:04:41 BoogieIcfgContainer [2022-04-27 13:04:41,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:04:41,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:04:41,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:04:41,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:04:41,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:04:40" (1/3) ... [2022-04-27 13:04:41,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cb02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:04:41, skipping insertion in model container [2022-04-27 13:04:41,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:40" (2/3) ... [2022-04-27 13:04:41,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cb02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:04:41, skipping insertion in model container [2022-04-27 13:04:41,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:04:41" (3/3) ... [2022-04-27 13:04:41,144 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound20.c [2022-04-27 13:04:41,155 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:04:41,156 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:04:41,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:04:41,203 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@28e7f7e3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b3bab89 [2022-04-27 13:04:41,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:04:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:04:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:04:41,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:41,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:41,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-27 13:04:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:41,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610526053] [2022-04-27 13:04:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:04:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:41,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(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; {43#true} is VALID [2022-04-27 13:04:41,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:04:41,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-27 13:04:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:04:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:41,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:41,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:41,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:41,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:04:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 13:04:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:41,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:41,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:41,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:41,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:04:41,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:04:41,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(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; {43#true} is VALID [2022-04-27 13:04:41,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:04:41,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-27 13:04:41,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-27 13:04:41,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#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;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; {43#true} is VALID [2022-04-27 13:04:41,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:04:41,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:41,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:41,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:41,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:04:41,440 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:04:41,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:41,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:41,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:41,441 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:04:41,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-27 13:04:41,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-27 13:04:41,442 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-27 13:04:41,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:04:41,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:04:41,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:04:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610526053] [2022-04-27 13:04:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610526053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:41,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:41,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:04:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526853454] [2022-04-27 13:04:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:41,451 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:04:41,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:41,455 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:41,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:41,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:04:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:04:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:04:41,506 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:41,674 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-27 13:04:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:04:41,674 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:04:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:41,675 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 13:04:41,691 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 13:04:41,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 13:04:41,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:41,836 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:04:41,836 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 13:04:41,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:04:41,846 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:41,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 13:04:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 13:04:41,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:41,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:41,887 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:41,888 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:41,892 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 13:04:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-27 13:04:41,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:41,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:41,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 13:04:41,895 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 13:04:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:41,899 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 13:04:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-27 13:04:41,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:41,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:41,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:41,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-27 13:04:41,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-27 13:04:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:41,906 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-27 13:04:41,906 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 13:04:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:04:41,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:41,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:41,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:04:41,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-27 13:04:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:41,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044409175] [2022-04-27 13:04:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:41,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:41,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267866016] [2022-04-27 13:04:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:41,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:41,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:41,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:41,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:04:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:04:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:42,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2022-04-27 13:04:42,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#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; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#(<= ~counter~0 0)} {284#true} #108#return; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#(<= ~counter~0 0)} call #t~ret9 := main(); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= ~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;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; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= ~counter~0 0)} ~cond := #in~cond; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= ~counter~0 0)} assume !(0 == ~cond); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} #94#return; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {292#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#(<= ~counter~0 0)} ~cond := #in~cond; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= ~counter~0 0)} assume !(0 == ~cond); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,270 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} #96#return; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {341#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:04:42,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {285#false} is VALID [2022-04-27 13:04:42,272 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {285#false} is VALID [2022-04-27 13:04:42,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#false} ~cond := #in~cond; {285#false} is VALID [2022-04-27 13:04:42,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#false} assume 0 == ~cond; {285#false} is VALID [2022-04-27 13:04:42,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-27 13:04:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:42,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:42,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044409175] [2022-04-27 13:04:42,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267866016] [2022-04-27 13:04:42,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267866016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:42,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:42,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:04:42,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630949958] [2022-04-27 13:04:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:42,276 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:04:42,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:42,276 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:42,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:04:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:04:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:04:42,298 INFO L87 Difference]: Start difference. First operand 35 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,402 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-27 13:04:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:04:42,402 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:04:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:42,404 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 13:04:42,409 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 13:04:42,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-27 13:04:42,455 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 13:04:42,459 INFO L225 Difference]: With dead ends: 44 [2022-04-27 13:04:42,459 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 13:04:42,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 13:04:42,461 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:42,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 13:04:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 13:04:42,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:42,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,481 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,482 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,489 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-27 13:04:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 13:04:42,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:42,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:42,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 13:04:42,493 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 13:04:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,503 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-27 13:04:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 13:04:42,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:42,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:42,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:42,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-27 13:04:42,506 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-27 13:04:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:42,507 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-27 13:04:42,507 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 13:04:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 13:04:42,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:42,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:42,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:42,708 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 13:04:42,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-27 13:04:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909813872] [2022-04-27 13:04:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:42,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071131047] [2022-04-27 13:04:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:42,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:42,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:04:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:04:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:42,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} call ULTIMATE.init(); {547#true} is VALID [2022-04-27 13:04:42,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#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; {547#true} is VALID [2022-04-27 13:04:42,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} assume true; {547#true} is VALID [2022-04-27 13:04:42,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} #108#return; {547#true} is VALID [2022-04-27 13:04:42,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} call #t~ret9 := main(); {547#true} is VALID [2022-04-27 13:04:42,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#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;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; {547#true} is VALID [2022-04-27 13:04:42,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {547#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {547#true} is VALID [2022-04-27 13:04:42,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} ~cond := #in~cond; {547#true} is VALID [2022-04-27 13:04:42,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} assume !(0 == ~cond); {547#true} is VALID [2022-04-27 13:04:42,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#true} assume true; {547#true} is VALID [2022-04-27 13:04:42,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {547#true} {547#true} #94#return; {547#true} is VALID [2022-04-27 13:04:42,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {547#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {547#true} is VALID [2022-04-27 13:04:42,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#true} ~cond := #in~cond; {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:42,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:42,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:42,959 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {547#true} #96#return; {599#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:42,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {603#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:42,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {603#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:42,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {603#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:42,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 main_~b~0)} assume !(0 != ~b~0); {548#false} is VALID [2022-04-27 13:04:42,961 INFO L272 TraceCheckUtils]: 20: Hoare triple {548#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {548#false} is VALID [2022-04-27 13:04:42,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#false} ~cond := #in~cond; {548#false} is VALID [2022-04-27 13:04:42,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} assume 0 == ~cond; {548#false} is VALID [2022-04-27 13:04:42,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} assume !false; {548#false} is VALID [2022-04-27 13:04:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:42,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:42,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909813872] [2022-04-27 13:04:42,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:42,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071131047] [2022-04-27 13:04:42,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071131047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:42,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:42,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:04:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826416752] [2022-04-27 13:04:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 13:04:42,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:42,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:42,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:42,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:04:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:04:42,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:42,998 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:43,280 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-27 13:04:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:04:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 13:04:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 13:04:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 13:04:43,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 13:04:43,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:43,367 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:04:43,367 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:04:43,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:04:43,370 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:43,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:04:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:04:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-27 13:04:43,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:43,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,394 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,394 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:43,397 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-27 13:04:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-27 13:04:43,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:43,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:43,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 13:04:43,403 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 13:04:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:43,410 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-27 13:04:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-27 13:04:43,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:43,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:43,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:43,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-27 13:04:43,415 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-27 13:04:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:43,416 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-27 13:04:43,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 13:04:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:04:43,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:43,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:43,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:43,631 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 13:04:43,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-27 13:04:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:43,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679246206] [2022-04-27 13:04:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:43,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:43,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592832364] [2022-04-27 13:04:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:43,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:43,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:04:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:43,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:04:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:43,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:43,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2022-04-27 13:04:43,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#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; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(<= ~counter~0 0)} {865#true} #108#return; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} call #t~ret9 := main(); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= ~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;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; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(<= ~counter~0 0)} ~cond := #in~cond; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == ~cond); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} #94#return; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,881 INFO L272 TraceCheckUtils]: 11: Hoare triple {873#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~counter~0 0)} ~cond := #in~cond; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == ~cond); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,882 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} #96#return; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:43,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {922#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:43,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {922#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:43,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {922#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:43,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {932#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:04:43,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {866#false} is VALID [2022-04-27 13:04:43,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#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; {866#false} is VALID [2022-04-27 13:04:43,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {866#false} is VALID [2022-04-27 13:04:43,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} assume !(#t~post6 < 20);havoc #t~post6; {866#false} is VALID [2022-04-27 13:04:43,890 INFO L272 TraceCheckUtils]: 25: Hoare triple {866#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {866#false} is VALID [2022-04-27 13:04:43,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} ~cond := #in~cond; {866#false} is VALID [2022-04-27 13:04:43,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} assume 0 == ~cond; {866#false} is VALID [2022-04-27 13:04:43,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-04-27 13:04:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:43,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679246206] [2022-04-27 13:04:43,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592832364] [2022-04-27 13:04:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592832364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:43,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:43,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:04:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481168834] [2022-04-27 13:04:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:43,894 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 13:04:43,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:43,895 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:43,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:43,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:04:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:04:43,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:43,914 INFO L87 Difference]: Start difference. First operand 38 states and 48 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:44,040 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-27 13:04:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:04:44,040 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 13:04:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:44,041 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-27 13:04:44,043 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-27 13:04:44,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-27 13:04:44,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:44,116 INFO L225 Difference]: With dead ends: 62 [2022-04-27 13:04:44,116 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 13:04:44,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:44,119 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:44,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 13:04:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 13:04:44,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:44,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,142 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,142 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:44,146 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 13:04:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 13:04:44,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:44,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:44,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 13:04:44,148 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 13:04:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:44,150 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 13:04:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 13:04:44,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:44,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:44,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:44,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-27 13:04:44,153 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-27 13:04:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:44,154 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-27 13:04:44,155 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 13:04:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:04:44,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:44,156 INFO L195 NwaCegarLoop]: trace histogram [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 13:04:44,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:44,363 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 13:04:44,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 795698770, now seen corresponding path program 1 times [2022-04-27 13:04:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:44,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993564696] [2022-04-27 13:04:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:44,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:44,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976704532] [2022-04-27 13:04:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:44,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:44,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:04:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:44,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 13:04:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:44,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:44,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-27 13:04:44,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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; {1183#true} is VALID [2022-04-27 13:04:44,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-27 13:04:44,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #108#return; {1183#true} is VALID [2022-04-27 13:04:44,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret9 := main(); {1183#true} is VALID [2022-04-27 13:04:44,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#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;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; {1183#true} is VALID [2022-04-27 13:04:44,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {1183#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1183#true} is VALID [2022-04-27 13:04:44,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-27 13:04:44,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-27 13:04:44,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-27 13:04:44,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1183#true} #94#return; {1183#true} is VALID [2022-04-27 13:04:44,829 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1183#true} is VALID [2022-04-27 13:04:44,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:44,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:44,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:44,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} {1183#true} #96#return; {1235#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:44,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:44,841 INFO L272 TraceCheckUtils]: 25: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~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)); {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:44,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:44,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1184#false} is VALID [2022-04-27 13:04:44,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-27 13:04:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:44,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:44,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993564696] [2022-04-27 13:04:44,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:44,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976704532] [2022-04-27 13:04:44,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976704532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:44,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:44,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 13:04:44,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815838215] [2022-04-27 13:04:44,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:44,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 13:04:44,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:44,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:44,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:04:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:04:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:04:44,869 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:45,560 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-27 13:04:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:45,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 13:04:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 13:04:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 13:04:45,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-27 13:04:45,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:45,654 INFO L225 Difference]: With dead ends: 68 [2022-04-27 13:04:45,654 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 13:04:45,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:04:45,655 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:45,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 237 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 13:04:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-27 13:04:45,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:45,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,697 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,697 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:45,700 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-27 13:04:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-27 13:04:45,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:45,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:45,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-27 13:04:45,701 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-27 13:04:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:45,704 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-27 13:04:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-27 13:04:45,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:45,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:45,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:45,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-27 13:04:45,707 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-27 13:04:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:45,707 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-27 13:04:45,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-27 13:04:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:04:45,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:45,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:45,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:45,930 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 13:04:45,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-27 13:04:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:45,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831628670] [2022-04-27 13:04:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:45,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:45,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992287535] [2022-04-27 13:04:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:45,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:45,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:04:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:46,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:04:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:46,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:46,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-27 13:04:46,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#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; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#(<= ~counter~0 0)} {1597#true} #108#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#(<= ~counter~0 0)} call #t~ret9 := main(); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#(<= ~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;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; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#(<= ~counter~0 0)} ~cond := #in~cond; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#(<= ~counter~0 0)} assume !(0 == ~cond); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} #94#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {1605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(<= ~counter~0 0)} ~cond := #in~cond; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(<= ~counter~0 0)} assume !(0 == ~cond); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,219 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} #96#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1654#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:46,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1654#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:46,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1654#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:46,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {1664#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {1664#(<= ~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; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {1664#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1677#(<= |main_#t~post6| 2)} is VALID [2022-04-27 13:04:46,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1598#false} is VALID [2022-04-27 13:04:46,228 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1598#false} is VALID [2022-04-27 13:04:46,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} ~cond := #in~cond; {1598#false} is VALID [2022-04-27 13:04:46,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} assume 0 == ~cond; {1598#false} is VALID [2022-04-27 13:04:46,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-27 13:04:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:46,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:46,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-27 13:04:46,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} assume 0 == ~cond; {1598#false} is VALID [2022-04-27 13:04:46,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} ~cond := #in~cond; {1598#false} is VALID [2022-04-27 13:04:46,446 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1598#false} is VALID [2022-04-27 13:04:46,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {1705#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1598#false} is VALID [2022-04-27 13:04:46,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:04:46,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(< ~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; {1709#(< ~counter~0 20)} is VALID [2022-04-27 13:04:46,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#(< ~counter~0 20)} assume !(~c~0 >= ~b~0); {1709#(< ~counter~0 20)} is VALID [2022-04-27 13:04:46,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {1709#(< ~counter~0 20)} is VALID [2022-04-27 13:04:46,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {1722#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1709#(< ~counter~0 20)} is VALID [2022-04-27 13:04:46,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< ~counter~0 19)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1722#(< ~counter~0 19)} is VALID [2022-04-27 13:04:46,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {1722#(< ~counter~0 19)} is VALID [2022-04-27 13:04:46,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1722#(< ~counter~0 19)} is VALID [2022-04-27 13:04:46,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {1732#(< ~counter~0 18)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1597#true} {1732#(< ~counter~0 18)} #96#return; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-27 13:04:46,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-27 13:04:46,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-27 13:04:46,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {1732#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1597#true} is VALID [2022-04-27 13:04:46,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1597#true} {1732#(< ~counter~0 18)} #94#return; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-27 13:04:46,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-27 13:04:46,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-27 13:04:46,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {1732#(< ~counter~0 18)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1597#true} is VALID [2022-04-27 13:04:46,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1732#(< ~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;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; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {1732#(< ~counter~0 18)} call #t~ret9 := main(); {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1732#(< ~counter~0 18)} {1597#true} #108#return; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1732#(< ~counter~0 18)} assume true; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#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; {1732#(< ~counter~0 18)} is VALID [2022-04-27 13:04:46,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-27 13:04:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831628670] [2022-04-27 13:04:46,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:46,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992287535] [2022-04-27 13:04:46,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992287535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:46,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:46,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:04:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924909393] [2022-04-27 13:04:46,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:46,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-27 13:04:46,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:46,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:46,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:46,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:04:46,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:46,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:04:46,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:04:46,501 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:47,080 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-04-27 13:04:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:04:47,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-27 13:04:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-04-27 13:04:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-04-27 13:04:47,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2022-04-27 13:04:47,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:47,201 INFO L225 Difference]: With dead ends: 151 [2022-04-27 13:04:47,201 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 13:04:47,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:04:47,202 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:47,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 257 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:04:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 13:04:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-04-27 13:04:47,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:47,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:47,316 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:47,316 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:47,322 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-27 13:04:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-27 13:04:47,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:47,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:47,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-27 13:04:47,323 INFO L87 Difference]: Start difference. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-27 13:04:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:47,329 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-27 13:04:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-27 13:04:47,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:47,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:47,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:47,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-04-27 13:04:47,333 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-04-27 13:04:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:47,334 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-04-27 13:04:47,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-04-27 13:04:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 13:04:47,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:47,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:47,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:47,558 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 13:04:47,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-27 13:04:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:47,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161824746] [2022-04-27 13:04:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:47,575 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:47,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892831644] [2022-04-27 13:04:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:47,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:47,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:47,582 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:47,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:04:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:47,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:04:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:47,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:47,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {2441#true} call ULTIMATE.init(); {2441#true} is VALID [2022-04-27 13:04:47,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#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; {2441#true} is VALID [2022-04-27 13:04:47,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-27 13:04:47,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2441#true} {2441#true} #108#return; {2441#true} is VALID [2022-04-27 13:04:47,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {2441#true} call #t~ret9 := main(); {2441#true} is VALID [2022-04-27 13:04:47,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#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;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; {2441#true} is VALID [2022-04-27 13:04:47,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {2441#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-27 13:04:47,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#true} ~cond := #in~cond; {2467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:47,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:47,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:47,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} {2441#true} #94#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:47,797 INFO L272 TraceCheckUtils]: 11: Hoare triple {2478#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-27 13:04:47,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#true} ~cond := #in~cond; {2441#true} is VALID [2022-04-27 13:04:47,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#true} assume !(0 == ~cond); {2441#true} is VALID [2022-04-27 13:04:47,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-27 13:04:47,798 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2441#true} {2478#(<= 1 main_~x~0)} #96#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:47,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2497#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {2497#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#(<= 1 main_~c~0)} assume !!(#t~post7 < 20);havoc #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(<= 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; {2520#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2442#false} is VALID [2022-04-27 13:04:47,802 INFO L272 TraceCheckUtils]: 27: Hoare triple {2442#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2442#false} is VALID [2022-04-27 13:04:47,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {2442#false} ~cond := #in~cond; {2442#false} is VALID [2022-04-27 13:04:47,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#false} assume 0 == ~cond; {2442#false} is VALID [2022-04-27 13:04:47,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2022-04-27 13:04:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:47,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:48,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2022-04-27 13:04:48,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#false} assume 0 == ~cond; {2442#false} is VALID [2022-04-27 13:04:48,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {2442#false} ~cond := #in~cond; {2442#false} is VALID [2022-04-27 13:04:48,039 INFO L272 TraceCheckUtils]: 27: Hoare triple {2442#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2442#false} is VALID [2022-04-27 13:04:48,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2442#false} is VALID [2022-04-27 13:04:48,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:48,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:48,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(<= 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; {2520#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:48,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:48,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#(<= 1 main_~c~0)} assume !!(#t~post7 < 20);havoc #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:48,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:48,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2507#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:48,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:48,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {2497#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:48,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2497#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:48,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2441#true} {2478#(<= 1 main_~x~0)} #96#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:48,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-27 13:04:48,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#true} assume !(0 == ~cond); {2441#true} is VALID [2022-04-27 13:04:48,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#true} ~cond := #in~cond; {2441#true} is VALID [2022-04-27 13:04:48,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {2478#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-27 13:04:48,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} {2441#true} #94#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:48,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:48,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {2611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:48,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#true} ~cond := #in~cond; {2611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:04:48,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {2441#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-27 13:04:48,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#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;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; {2441#true} is VALID [2022-04-27 13:04:48,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {2441#true} call #t~ret9 := main(); {2441#true} is VALID [2022-04-27 13:04:48,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2441#true} {2441#true} #108#return; {2441#true} is VALID [2022-04-27 13:04:48,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-27 13:04:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#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; {2441#true} is VALID [2022-04-27 13:04:48,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {2441#true} call ULTIMATE.init(); {2441#true} is VALID [2022-04-27 13:04:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161824746] [2022-04-27 13:04:48,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892831644] [2022-04-27 13:04:48,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892831644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:48,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:48,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:04:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807107744] [2022-04-27 13:04:48,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:48,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-27 13:04:48,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:48,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:48,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:48,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:04:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:04:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:04:48,078 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:49,081 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2022-04-27 13:04:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:49,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-27 13:04:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 13:04:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 13:04:49,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-27 13:04:49,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:49,218 INFO L225 Difference]: With dead ends: 187 [2022-04-27 13:04:49,218 INFO L226 Difference]: Without dead ends: 175 [2022-04-27 13:04:49,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 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 13:04:49,219 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:49,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 358 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-27 13:04:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-04-27 13:04:49,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:49,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:49,379 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:49,379 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:49,386 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-27 13:04:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-27 13:04:49,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:49,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:49,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-27 13:04:49,388 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-27 13:04:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:49,394 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-27 13:04:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-27 13:04:49,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:49,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:49,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:49,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-04-27 13:04:49,400 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-04-27 13:04:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:49,400 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-04-27 13:04:49,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-04-27 13:04:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 13:04:49,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:49,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:49,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:49,615 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 13:04:49,615 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash 495607521, now seen corresponding path program 1 times [2022-04-27 13:04:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:49,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434930172] [2022-04-27 13:04:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:49,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:49,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042753581] [2022-04-27 13:04:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:49,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:04:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:49,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 13:04:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:49,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:50,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2022-04-27 13:04:50,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {3457#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; {3457#true} is VALID [2022-04-27 13:04:50,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {3457#true} assume true; {3457#true} is VALID [2022-04-27 13:04:50,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} #108#return; {3457#true} is VALID [2022-04-27 13:04:50,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {3457#true} call #t~ret9 := main(); {3457#true} is VALID [2022-04-27 13:04:50,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {3457#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;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; {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {3457#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {3457#true} ~cond := #in~cond; {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#true} assume !(0 == ~cond); {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {3457#true} assume true; {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3457#true} {3457#true} #94#return; {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L272 TraceCheckUtils]: 11: Hoare triple {3457#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3457#true} is VALID [2022-04-27 13:04:50,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#true} ~cond := #in~cond; {3498#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:50,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {3498#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3502#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:50,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {3502#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3502#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:50,103 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3502#(not (= |assume_abort_if_not_#in~cond| 0))} {3457#true} #96#return; {3509#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:50,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {3509#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post8 < 20);havoc #t~post8; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,107 INFO L272 TraceCheckUtils]: 25: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~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)); {3457#true} is VALID [2022-04-27 13:04:50,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {3457#true} ~cond := #in~cond; {3457#true} is VALID [2022-04-27 13:04:50,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {3457#true} assume !(0 == ~cond); {3457#true} is VALID [2022-04-27 13:04:50,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {3457#true} assume true; {3457#true} is VALID [2022-04-27 13:04:50,109 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3457#true} {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #98#return; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:50,110 INFO L272 TraceCheckUtils]: 30: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~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)); {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:50,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:50,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {3562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3458#false} is VALID [2022-04-27 13:04:50,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2022-04-27 13:04:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:50,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:50,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434930172] [2022-04-27 13:04:50,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:50,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042753581] [2022-04-27 13:04:50,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042753581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:50,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:50,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 13:04:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361055037] [2022-04-27 13:04:50,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:50,112 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 13:04:50,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:50,113 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:04:50,138 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 13:04:50,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:04:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:04:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:04:50,139 INFO L87 Difference]: Start difference. First operand 132 states and 180 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:04:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:50,982 INFO L93 Difference]: Finished difference Result 157 states and 210 transitions. [2022-04-27 13:04:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:50,982 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 13:04:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:50,983 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:04:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-27 13:04:50,984 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:04:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-27 13:04:50,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-04-27 13:04:51,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:51,077 INFO L225 Difference]: With dead ends: 157 [2022-04-27 13:04:51,077 INFO L226 Difference]: Without dead ends: 155 [2022-04-27 13:04:51,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:04:51,078 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:51,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 241 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-27 13:04:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-04-27 13:04:51,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:51,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:51,248 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:51,248 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:51,253 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-27 13:04:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-27 13:04:51,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:51,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:51,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-27 13:04:51,255 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-27 13:04:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:51,259 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-27 13:04:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-27 13:04:51,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:51,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:51,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:51,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-04-27 13:04:51,264 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-04-27 13:04:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:51,265 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-04-27 13:04:51,266 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:04:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-04-27 13:04:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:04:51,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:51,271 INFO L195 NwaCegarLoop]: trace histogram [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 13:04:51,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:51,491 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 13:04:51,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-27 13:04:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:51,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298704855] [2022-04-27 13:04:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:51,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:51,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841751659] [2022-04-27 13:04:51,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:51,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:51,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:04:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:51,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 13:04:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:51,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:51,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {4310#true} call ULTIMATE.init(); {4310#true} is VALID [2022-04-27 13:04:51,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {4310#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; {4310#true} is VALID [2022-04-27 13:04:51,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-27 13:04:51,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4310#true} {4310#true} #108#return; {4310#true} is VALID [2022-04-27 13:04:51,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {4310#true} call #t~ret9 := main(); {4310#true} is VALID [2022-04-27 13:04:51,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {4310#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;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; {4310#true} is VALID [2022-04-27 13:04:51,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {4310#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-27 13:04:51,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {4310#true} ~cond := #in~cond; {4336#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:51,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {4336#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4340#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:51,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4340#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:51,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4340#(not (= |assume_abort_if_not_#in~cond| 0))} {4310#true} #94#return; {4347#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:51,920 INFO L272 TraceCheckUtils]: 11: Hoare triple {4347#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-27 13:04:51,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {4310#true} ~cond := #in~cond; {4310#true} is VALID [2022-04-27 13:04:51,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#true} assume !(0 == ~cond); {4310#true} is VALID [2022-04-27 13:04:51,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-27 13:04:51,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4310#true} {4347#(<= 1 main_~x~0)} #96#return; {4347#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:51,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {4347#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {4366#(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; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {4366#(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; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {4366#(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; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {4366#(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; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:51,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~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; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post8 < 20);havoc #t~post8; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:51,930 INFO L272 TraceCheckUtils]: 32: Hoare triple {4388#(and (<= 1 main_~x~0) (= 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)); {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:51,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:51,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {4420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4311#false} is VALID [2022-04-27 13:04:51,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {4311#false} assume !false; {4311#false} is VALID [2022-04-27 13:04:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:51,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:52,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {4311#false} assume !false; {4311#false} is VALID [2022-04-27 13:04:52,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {4420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4311#false} is VALID [2022-04-27 13:04:52,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:52,181 INFO L272 TraceCheckUtils]: 32: Hoare triple {4436#(= 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)); {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:52,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {4464#(= 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; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:52,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {4310#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:52,188 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4310#true} {4310#true} #96#return; {4310#true} is VALID [2022-04-27 13:04:52,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-27 13:04:52,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#true} assume !(0 == ~cond); {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {4310#true} ~cond := #in~cond; {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L272 TraceCheckUtils]: 11: Hoare triple {4310#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4310#true} {4310#true} #94#return; {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {4310#true} assume !(0 == ~cond); {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {4310#true} ~cond := #in~cond; {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {4310#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {4310#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;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; {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {4310#true} call #t~ret9 := main(); {4310#true} is VALID [2022-04-27 13:04:52,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4310#true} {4310#true} #108#return; {4310#true} is VALID [2022-04-27 13:04:52,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-27 13:04:52,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {4310#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; {4310#true} is VALID [2022-04-27 13:04:52,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {4310#true} call ULTIMATE.init(); {4310#true} is VALID [2022-04-27 13:04:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298704855] [2022-04-27 13:04:52,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841751659] [2022-04-27 13:04:52,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841751659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:52,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:52,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-27 13:04:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964679207] [2022-04-27 13:04:52,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:52,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 36 [2022-04-27 13:04:52,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:52,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 13:04:52,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:52,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:04:52,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:52,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:04:52,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:04:52,233 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 13:04:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:53,047 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-04-27 13:04:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:04:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 36 [2022-04-27 13:04:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 13:04:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 13:04:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 13:04:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 13:04:53,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-27 13:04:53,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:53,132 INFO L225 Difference]: With dead ends: 179 [2022-04-27 13:04:53,132 INFO L226 Difference]: Without dead ends: 177 [2022-04-27 13:04:53,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:04:53,133 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:53,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-27 13:04:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-04-27 13:04:53,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:53,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:53,335 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:53,335 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:53,340 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-27 13:04:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-27 13:04:53,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:53,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:53,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-27 13:04:53,342 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-27 13:04:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:53,347 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-27 13:04:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-27 13:04:53,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:53,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:53,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:53,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-04-27 13:04:53,354 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-04-27 13:04:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:53,354 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-04-27 13:04:53,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 13:04:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-04-27 13:04:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:04:53,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:53,355 INFO L195 NwaCegarLoop]: trace histogram [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 13:04:53,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:53,567 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 13:04:53,568 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash -892181054, now seen corresponding path program 1 times [2022-04-27 13:04:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:53,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913485082] [2022-04-27 13:04:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:53,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:53,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702693433] [2022-04-27 13:04:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:53,584 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:53,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:04:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:53,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:04:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:53,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:53,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {5394#true} call ULTIMATE.init(); {5394#true} is VALID [2022-04-27 13:04:53,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5394#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; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {5402#(<= ~counter~0 0)} assume true; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5402#(<= ~counter~0 0)} {5394#true} #108#return; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {5402#(<= ~counter~0 0)} call #t~ret9 := main(); {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {5402#(<= ~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;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; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {5402#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {5402#(<= ~counter~0 0)} ~cond := #in~cond; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {5402#(<= ~counter~0 0)} assume !(0 == ~cond); {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {5402#(<= ~counter~0 0)} assume true; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5402#(<= ~counter~0 0)} {5402#(<= ~counter~0 0)} #94#return; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {5402#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {5402#(<= ~counter~0 0)} ~cond := #in~cond; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {5402#(<= ~counter~0 0)} assume !(0 == ~cond); {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {5402#(<= ~counter~0 0)} assume true; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5402#(<= ~counter~0 0)} {5402#(<= ~counter~0 0)} #96#return; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {5402#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5402#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:53,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {5402#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5451#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:53,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {5451#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {5451#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:53,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {5451#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5451#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:53,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {5451#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5461#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:53,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {5461#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {5461#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:53,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {5461#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5461#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:53,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {5461#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5471#(<= |main_#t~post8| 2)} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {5471#(<= |main_#t~post8| 2)} assume !(#t~post8 < 20);havoc #t~post8; {5395#false} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {5395#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {5395#false} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {5395#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5395#false} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {5395#false} assume !(#t~post7 < 20);havoc #t~post7; {5395#false} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {5395#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; {5395#false} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {5395#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5395#false} is VALID [2022-04-27 13:04:53,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {5395#false} assume !!(#t~post6 < 20);havoc #t~post6; {5395#false} is VALID [2022-04-27 13:04:53,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {5395#false} assume !(0 != ~b~0); {5395#false} is VALID [2022-04-27 13:04:53,838 INFO L272 TraceCheckUtils]: 32: Hoare triple {5395#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5395#false} is VALID [2022-04-27 13:04:53,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {5395#false} ~cond := #in~cond; {5395#false} is VALID [2022-04-27 13:04:53,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {5395#false} assume 0 == ~cond; {5395#false} is VALID [2022-04-27 13:04:53,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {5395#false} assume !false; {5395#false} is VALID [2022-04-27 13:04:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:53,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:53,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913485082] [2022-04-27 13:04:53,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:53,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702693433] [2022-04-27 13:04:53,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702693433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:53,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:53,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:04:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284732323] [2022-04-27 13:04:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 13:04:53,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:53,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:53,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:53,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:04:53,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:53,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:04:53,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:53,870 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:54,192 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-04-27 13:04:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:04:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 13:04:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-27 13:04:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-27 13:04:54,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-27 13:04:54,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:54,268 INFO L225 Difference]: With dead ends: 241 [2022-04-27 13:04:54,268 INFO L226 Difference]: Without dead ends: 174 [2022-04-27 13:04:54,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:54,270 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:54,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-27 13:04:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-04-27 13:04:54,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:54,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:54,539 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:54,539 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:54,546 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-27 13:04:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-27 13:04:54,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:54,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:54,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-27 13:04:54,551 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-27 13:04:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:54,557 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-27 13:04:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-27 13:04:54,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:54,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:54,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:54,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-27 13:04:54,569 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-04-27 13:04:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:54,569 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-27 13:04:54,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-27 13:04:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:04:54,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:54,571 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:54,596 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 13:04:54,791 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 13:04:54,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-27 13:04:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:54,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333822366] [2022-04-27 13:04:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:54,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:54,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379551154] [2022-04-27 13:04:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:54,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:54,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:04:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:54,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:04:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:54,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:59,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {6441#true} call ULTIMATE.init(); {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {6441#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; {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6441#true} {6441#true} #108#return; {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {6441#true} call #t~ret9 := main(); {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {6441#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;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; {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {6441#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6441#true} is VALID [2022-04-27 13:04:59,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6441#true} {6441#true} #94#return; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L272 TraceCheckUtils]: 11: Hoare triple {6441#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6441#true} {6441#true} #96#return; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {6441#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {6441#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6441#true} is VALID [2022-04-27 13:04:59,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {6441#true} assume !!(#t~post6 < 20);havoc #t~post6; {6441#true} is VALID [2022-04-27 13:04:59,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,017 INFO L272 TraceCheckUtils]: 25: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6441#true} is VALID [2022-04-27 13:04:59,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-27 13:04:59,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-27 13:04:59,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-27 13:04:59,019 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6441#true} {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #98#return; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,019 INFO L272 TraceCheckUtils]: 30: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6441#true} is VALID [2022-04-27 13:04:59,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-27 13:04:59,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-27 13:04:59,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-27 13:04:59,020 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6441#true} {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #100#return; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:59,020 INFO L272 TraceCheckUtils]: 35: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:59,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {6552#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:59,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {6556#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6442#false} is VALID [2022-04-27 13:04:59,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {6442#false} assume !false; {6442#false} is VALID [2022-04-27 13:04:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:04:59,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333822366] [2022-04-27 13:04:59,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379551154] [2022-04-27 13:04:59,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379551154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:59,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:59,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:04:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991635546] [2022-04-27 13:04:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 13:04:59,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:59,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:59,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:59,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:04:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:59,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:04:59,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:59,050 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:59,503 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2022-04-27 13:04:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:04:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 13:04:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:04:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:04:59,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 13:04:59,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:59,574 INFO L225 Difference]: With dead ends: 239 [2022-04-27 13:04:59,574 INFO L226 Difference]: Without dead ends: 237 [2022-04-27 13:04:59,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:59,575 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 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 13:04:59,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-27 13:04:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-04-27 13:04:59,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:59,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:59,883 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:59,883 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:59,890 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-27 13:04:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-27 13:04:59,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:59,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:59,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-27 13:04:59,892 INFO L87 Difference]: Start difference. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-27 13:04:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:59,899 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-27 13:04:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-27 13:04:59,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:59,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:59,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:59,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-04-27 13:04:59,907 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-04-27 13:04:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:59,907 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-04-27 13:04:59,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-04-27 13:04:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:04:59,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:59,908 INFO L195 NwaCegarLoop]: trace histogram [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 13:04:59,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:00,126 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 13:05:00,126 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-27 13:05:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:00,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597477047] [2022-04-27 13:05:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:00,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:00,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27279708] [2022-04-27 13:05:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:00,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:00,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:00,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:00,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:05:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 13:05:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:00,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:02,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {7713#true} call ULTIMATE.init(); {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {7713#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; {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7713#true} {7713#true} #108#return; {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {7713#true} call #t~ret9 := main(); {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {7713#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;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; {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {7713#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:02,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7713#true} {7713#true} #94#return; {7713#true} is VALID [2022-04-27 13:05:02,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {7713#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-27 13:05:02,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-27 13:05:02,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-27 13:05:02,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:02,523 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7713#true} {7713#true} #96#return; {7713#true} is VALID [2022-04-27 13:05:02,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {7713#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:02,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:02,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:02,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7776#(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 13:05:02,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {7776#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7776#(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 13:05:02,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {7776#(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 !!(#t~post7 < 20);havoc #t~post7; {7776#(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 13:05:02,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {7776#(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); {7776#(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 13:05:02,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {7776#(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; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,529 INFO L272 TraceCheckUtils]: 32: Hoare triple {7789#(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)); {7713#true} is VALID [2022-04-27 13:05:02,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-27 13:05:02,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-27 13:05:02,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:02,530 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7713#true} {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #98#return; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:05:02,530 INFO L272 TraceCheckUtils]: 37: Hoare triple {7789#(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)); {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:02,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:02,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {7836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7714#false} is VALID [2022-04-27 13:05:02,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#false} assume !false; {7714#false} is VALID [2022-04-27 13:05:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:05:02,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:02,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#false} assume !false; {7714#false} is VALID [2022-04-27 13:05:02,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {7836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7714#false} is VALID [2022-04-27 13:05:02,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:02,751 INFO L272 TraceCheckUtils]: 37: Hoare triple {7852#(= 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)); {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:02,752 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7713#true} {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:02,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-27 13:05:02,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-27 13:05:02,752 INFO L272 TraceCheckUtils]: 32: Hoare triple {7852#(= 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)); {7713#true} is VALID [2022-04-27 13:05:02,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:02,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:05:04,757 WARN L290 TraceCheckUtils]: 23: Hoare triple {7895#(= (+ (* (+ (* (* 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; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-27 13:05:04,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {7895#(= (+ (* (+ (* (* 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); {7895#(= (+ (* (+ (* (* 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:05:04,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {7895#(= (+ (* (+ (* (* 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; {7895#(= (+ (* (+ (* (* 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:05:04,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {7895#(= (+ (* (+ (* (* 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; {7895#(= (+ (* (+ (* (* 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:05:04,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7895#(= (+ (* (+ (* (* 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:05:04,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:05:04,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:05:04,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {7713#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:05:04,761 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7713#true} {7713#true} #96#return; {7713#true} is VALID [2022-04-27 13:05:04,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:04,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-27 13:05:04,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-27 13:05:04,761 INFO L272 TraceCheckUtils]: 11: Hoare triple {7713#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-27 13:05:04,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7713#true} {7713#true} #94#return; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {7713#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {7713#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;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; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {7713#true} call #t~ret9 := main(); {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7713#true} {7713#true} #108#return; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {7713#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; {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {7713#true} call ULTIMATE.init(); {7713#true} is VALID [2022-04-27 13:05:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:05:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597477047] [2022-04-27 13:05:04,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:04,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27279708] [2022-04-27 13:05:04,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27279708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:04,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:04,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:05:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720382888] [2022-04-27 13:05:04,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-27 13:05:04,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:04,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:05,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:05,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:05:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:05,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:05:05,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:05:05,063 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:07,543 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2022-04-27 13:05:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:05:07,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-27 13:05:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-27 13:05:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-27 13:05:07,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 252 transitions. [2022-04-27 13:05:08,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:08,556 INFO L225 Difference]: With dead ends: 392 [2022-04-27 13:05:08,556 INFO L226 Difference]: Without dead ends: 390 [2022-04-27 13:05:08,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:05:08,557 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:08,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:05:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-27 13:05:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-04-27 13:05:09,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:09,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:09,059 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:09,059 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:09,074 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-27 13:05:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-27 13:05:09,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:09,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:09,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-27 13:05:09,077 INFO L87 Difference]: Start difference. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-27 13:05:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:09,091 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-27 13:05:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-27 13:05:09,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:09,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:09,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:09,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-04-27 13:05:09,110 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-04-27 13:05:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:09,110 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-04-27 13:05:09,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-04-27 13:05:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 13:05:09,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:09,111 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-27 13:05:09,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:09,331 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 13:05:09,332 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-27 13:05:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671738210] [2022-04-27 13:05:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:09,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163931795] [2022-04-27 13:05:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:09,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:09,355 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:09,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 13:05:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:09,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:05:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:09,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:09,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {9884#true} call ULTIMATE.init(); {9884#true} is VALID [2022-04-27 13:05:09,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {9884#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; {9884#true} is VALID [2022-04-27 13:05:09,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-27 13:05:09,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9884#true} {9884#true} #108#return; {9884#true} is VALID [2022-04-27 13:05:09,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {9884#true} call #t~ret9 := main(); {9884#true} is VALID [2022-04-27 13:05:09,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {9884#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;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; {9884#true} is VALID [2022-04-27 13:05:09,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {9884#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9884#true} {9884#true} #94#return; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {9884#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9884#true} {9884#true} #96#return; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {9884#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {9884#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {9884#true} assume !!(#t~post6 < 20);havoc #t~post6; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {9884#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {9884#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9884#true} is VALID [2022-04-27 13:05:09,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {9884#true} assume !!(#t~post7 < 20);havoc #t~post7; {9884#true} is VALID [2022-04-27 13:05:09,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {9884#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:09,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:09,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:09,523 INFO L272 TraceCheckUtils]: 25: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9884#true} is VALID [2022-04-27 13:05:09,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-27 13:05:09,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-27 13:05:09,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-27 13:05:09,524 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #98#return; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:09,524 INFO L272 TraceCheckUtils]: 30: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9884#true} is VALID [2022-04-27 13:05:09,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-27 13:05:09,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-27 13:05:09,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-27 13:05:09,528 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #100#return; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:09,546 INFO L272 TraceCheckUtils]: 35: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9884#true} is VALID [2022-04-27 13:05:09,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-27 13:05:09,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-27 13:05:09,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-27 13:05:09,547 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:09,548 INFO L272 TraceCheckUtils]: 40: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10010#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:09,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {10010#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10014#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:09,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {10014#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9885#false} is VALID [2022-04-27 13:05:09,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {9885#false} assume !false; {9885#false} is VALID [2022-04-27 13:05:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:05:09,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:05:09,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:09,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671738210] [2022-04-27 13:05:09,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:09,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163931795] [2022-04-27 13:05:09,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163931795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:05:09,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:05:09,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:05:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482797387] [2022-04-27 13:05:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:05:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-27 13:05:09,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:09,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:09,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:09,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:05:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:09,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:05:09,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:05:09,577 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:10,607 INFO L93 Difference]: Finished difference Result 566 states and 887 transitions. [2022-04-27 13:05:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:05:10,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-27 13:05:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:05:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:05:10,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 13:05:10,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:10,683 INFO L225 Difference]: With dead ends: 566 [2022-04-27 13:05:10,683 INFO L226 Difference]: Without dead ends: 564 [2022-04-27 13:05:10,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:05:10,684 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:10,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:05:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-04-27 13:05:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-04-27 13:05:11,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:11,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:11,453 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:11,453 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,478 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-27 13:05:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-27 13:05:11,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:11,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:11,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-27 13:05:11,482 INFO L87 Difference]: Start difference. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-27 13:05:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,507 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-27 13:05:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-27 13:05:11,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:11,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:11,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:11,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-04-27 13:05:11,537 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-04-27 13:05:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:11,537 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-04-27 13:05:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-04-27 13:05:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:05:11,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:11,538 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-04-27 13:05:11,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:11,759 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 13:05:11,759 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1018638220, now seen corresponding path program 1 times [2022-04-27 13:05:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:11,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194547791] [2022-04-27 13:05:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:11,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:11,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466253010] [2022-04-27 13:05:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:11,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:11,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:11,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:11,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 13:05:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:11,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:05:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:11,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:12,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {12762#true} call ULTIMATE.init(); {12762#true} is VALID [2022-04-27 13:05:12,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {12762#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; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {12770#(<= ~counter~0 0)} assume true; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12770#(<= ~counter~0 0)} {12762#true} #108#return; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {12770#(<= ~counter~0 0)} call #t~ret9 := main(); {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {12770#(<= ~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;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; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {12770#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {12770#(<= ~counter~0 0)} ~cond := #in~cond; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {12770#(<= ~counter~0 0)} assume !(0 == ~cond); {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {12770#(<= ~counter~0 0)} assume true; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,013 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12770#(<= ~counter~0 0)} {12770#(<= ~counter~0 0)} #94#return; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,013 INFO L272 TraceCheckUtils]: 11: Hoare triple {12770#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {12770#(<= ~counter~0 0)} ~cond := #in~cond; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {12770#(<= ~counter~0 0)} assume !(0 == ~cond); {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {12770#(<= ~counter~0 0)} assume true; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,019 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12770#(<= ~counter~0 0)} {12770#(<= ~counter~0 0)} #96#return; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {12770#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12770#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:12,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {12770#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12819#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:12,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {12819#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {12819#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:12,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {12819#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12819#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:12,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {12819#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12829#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:12,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {12829#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {12829#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:12,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {12829#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {12829#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:12,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {12829#(<= ~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; {12829#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:12,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {12829#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12842#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:12,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {12842#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {12842#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:12,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {12842#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12842#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {12842#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12852#(<= |main_#t~post7| 3)} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {12852#(<= |main_#t~post7| 3)} assume !(#t~post7 < 20);havoc #t~post7; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {12763#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; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {12763#false} assume !!(#t~post6 < 20);havoc #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {12763#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {12763#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {12763#false} assume !(#t~post7 < 20);havoc #t~post7; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {12763#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; {12763#false} is VALID [2022-04-27 13:05:12,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {12763#false} assume !(#t~post6 < 20);havoc #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,025 INFO L272 TraceCheckUtils]: 38: Hoare triple {12763#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {12763#false} is VALID [2022-04-27 13:05:12,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {12763#false} ~cond := #in~cond; {12763#false} is VALID [2022-04-27 13:05:12,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {12763#false} assume 0 == ~cond; {12763#false} is VALID [2022-04-27 13:05:12,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {12763#false} assume !false; {12763#false} is VALID [2022-04-27 13:05:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 13:05:12,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:12,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {12763#false} assume !false; {12763#false} is VALID [2022-04-27 13:05:12,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {12763#false} assume 0 == ~cond; {12763#false} is VALID [2022-04-27 13:05:12,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {12763#false} ~cond := #in~cond; {12763#false} is VALID [2022-04-27 13:05:12,254 INFO L272 TraceCheckUtils]: 38: Hoare triple {12763#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {12763#false} is VALID [2022-04-27 13:05:12,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {12763#false} assume !(#t~post6 < 20);havoc #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {12763#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; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {12763#false} assume !(#t~post7 < 20);havoc #t~post7; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {12763#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {12763#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {12763#false} assume !!(#t~post6 < 20);havoc #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {12763#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; {12763#false} is VALID [2022-04-27 13:05:12,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {12934#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {12763#false} is VALID [2022-04-27 13:05:12,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {12938#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12934#(< |main_#t~post7| 20)} is VALID [2022-04-27 13:05:12,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {12938#(< ~counter~0 20)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12938#(< ~counter~0 20)} is VALID [2022-04-27 13:05:12,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {12938#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {12938#(< ~counter~0 20)} is VALID [2022-04-27 13:05:12,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {12948#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12938#(< ~counter~0 20)} is VALID [2022-04-27 13:05:12,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {12948#(< ~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; {12948#(< ~counter~0 19)} is VALID [2022-04-27 13:05:12,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {12948#(< ~counter~0 19)} assume !(~c~0 >= ~b~0); {12948#(< ~counter~0 19)} is VALID [2022-04-27 13:05:12,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {12948#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {12948#(< ~counter~0 19)} is VALID [2022-04-27 13:05:12,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {12961#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12948#(< ~counter~0 19)} is VALID [2022-04-27 13:05:12,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {12961#(< ~counter~0 18)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12961#(< ~counter~0 18)} is VALID [2022-04-27 13:05:12,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {12961#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {12961#(< ~counter~0 18)} is VALID [2022-04-27 13:05:12,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {12971#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12961#(< ~counter~0 18)} is VALID [2022-04-27 13:05:12,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {12971#(< ~counter~0 17)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12762#true} {12971#(< ~counter~0 17)} #96#return; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {12762#true} assume true; {12762#true} is VALID [2022-04-27 13:05:12,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {12762#true} assume !(0 == ~cond); {12762#true} is VALID [2022-04-27 13:05:12,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {12762#true} ~cond := #in~cond; {12762#true} is VALID [2022-04-27 13:05:12,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {12971#(< ~counter~0 17)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12762#true} is VALID [2022-04-27 13:05:12,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12762#true} {12971#(< ~counter~0 17)} #94#return; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {12762#true} assume true; {12762#true} is VALID [2022-04-27 13:05:12,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {12762#true} assume !(0 == ~cond); {12762#true} is VALID [2022-04-27 13:05:12,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {12762#true} ~cond := #in~cond; {12762#true} is VALID [2022-04-27 13:05:12,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {12971#(< ~counter~0 17)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12762#true} is VALID [2022-04-27 13:05:12,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {12971#(< ~counter~0 17)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {12971#(< ~counter~0 17)} call #t~ret9 := main(); {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12971#(< ~counter~0 17)} {12762#true} #108#return; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {12971#(< ~counter~0 17)} assume true; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {12762#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; {12971#(< ~counter~0 17)} is VALID [2022-04-27 13:05:12,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {12762#true} call ULTIMATE.init(); {12762#true} is VALID [2022-04-27 13:05:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 13:05:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194547791] [2022-04-27 13:05:12,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466253010] [2022-04-27 13:05:12,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466253010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:12,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:12,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 13:05:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803246476] [2022-04-27 13:05:12,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 13:05:12,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:12,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:12,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:12,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:05:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:05:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:05:12,316 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:14,238 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2022-04-27 13:05:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:05:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 13:05:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 224 transitions. [2022-04-27 13:05:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 224 transitions. [2022-04-27 13:05:14,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 224 transitions. [2022-04-27 13:05:14,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:14,476 INFO L225 Difference]: With dead ends: 1127 [2022-04-27 13:05:14,476 INFO L226 Difference]: Without dead ends: 770 [2022-04-27 13:05:14,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:05:14,478 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 156 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:14,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 390 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:05:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-27 13:05:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-04-27 13:05:15,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:15,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-27 13:05:15,599 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-27 13:05:15,600 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-27 13:05:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:15,639 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-27 13:05:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-27 13:05:15,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:15,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:15,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-27 13:05:15,644 INFO L87 Difference]: Start difference. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-27 13:05:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:15,682 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-27 13:05:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-27 13:05:15,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:15,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:15,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:15,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-27 13:05:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-04-27 13:05:15,729 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-04-27 13:05:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:15,730 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-04-27 13:05:15,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-04-27 13:05:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:05:15,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:15,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:15,755 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 13:05:15,943 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 13:05:15,943 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2064241646, now seen corresponding path program 1 times [2022-04-27 13:05:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:15,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508313999] [2022-04-27 13:05:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:15,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:15,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361920262] [2022-04-27 13:05:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:15,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:15,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:15,965 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 13:05:15,987 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 13:05:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:16,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:05:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:16,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:16,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} call ULTIMATE.init(); {17410#true} is VALID [2022-04-27 13:05:16,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#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; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#(<= ~counter~0 0)} assume true; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17418#(<= ~counter~0 0)} {17410#true} #108#return; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {17418#(<= ~counter~0 0)} call #t~ret9 := main(); {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {17418#(<= ~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;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; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {17418#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {17418#(<= ~counter~0 0)} ~cond := #in~cond; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {17418#(<= ~counter~0 0)} assume !(0 == ~cond); {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {17418#(<= ~counter~0 0)} assume true; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17418#(<= ~counter~0 0)} {17418#(<= ~counter~0 0)} #94#return; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,265 INFO L272 TraceCheckUtils]: 11: Hoare triple {17418#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {17418#(<= ~counter~0 0)} ~cond := #in~cond; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {17418#(<= ~counter~0 0)} assume !(0 == ~cond); {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {17418#(<= ~counter~0 0)} assume true; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,266 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17418#(<= ~counter~0 0)} {17418#(<= ~counter~0 0)} #96#return; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {17418#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17418#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:16,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {17418#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17467#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:16,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {17467#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {17467#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:16,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {17467#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17467#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:16,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {17467#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17477#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:16,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {17477#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {17477#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:16,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {17477#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {17477#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:16,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {17477#(<= ~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; {17477#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:16,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {17477#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17490#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:16,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {17490#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {17490#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:16,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {17490#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17490#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:16,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {17490#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17500#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:16,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {17500#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {17500#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:16,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {17500#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17500#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:16,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {17500#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17510#(<= |main_#t~post8| 4)} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {17510#(<= |main_#t~post8| 4)} assume !(#t~post8 < 20);havoc #t~post8; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {17411#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {17411#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {17411#false} assume !!(#t~post7 < 20);havoc #t~post7; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {17411#false} assume !(~c~0 >= ~b~0); {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {17411#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; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {17411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {17411#false} assume !(#t~post6 < 20);havoc #t~post6; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L272 TraceCheckUtils]: 39: Hoare triple {17411#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {17411#false} ~cond := #in~cond; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {17411#false} assume 0 == ~cond; {17411#false} is VALID [2022-04-27 13:05:16,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {17411#false} assume !false; {17411#false} is VALID [2022-04-27 13:05:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:05:16,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {17411#false} assume !false; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {17411#false} assume 0 == ~cond; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {17411#false} ~cond := #in~cond; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L272 TraceCheckUtils]: 39: Hoare triple {17411#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {17411#false} assume !(#t~post6 < 20);havoc #t~post6; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {17411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {17411#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; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {17411#false} assume !(~c~0 >= ~b~0); {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {17411#false} assume !!(#t~post7 < 20);havoc #t~post7; {17411#false} is VALID [2022-04-27 13:05:16,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {17411#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17411#false} is VALID [2022-04-27 13:05:16,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {17411#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {17411#false} is VALID [2022-04-27 13:05:16,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {17580#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {17411#false} is VALID [2022-04-27 13:05:16,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {17584#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17580#(< |main_#t~post8| 20)} is VALID [2022-04-27 13:05:16,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {17584#(< ~counter~0 20)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17584#(< ~counter~0 20)} is VALID [2022-04-27 13:05:16,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {17584#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {17584#(< ~counter~0 20)} is VALID [2022-04-27 13:05:16,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {17594#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17584#(< ~counter~0 20)} is VALID [2022-04-27 13:05:16,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {17594#(< ~counter~0 19)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17594#(< ~counter~0 19)} is VALID [2022-04-27 13:05:16,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {17594#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {17594#(< ~counter~0 19)} is VALID [2022-04-27 13:05:16,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {17604#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17594#(< ~counter~0 19)} is VALID [2022-04-27 13:05:16,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {17604#(< ~counter~0 18)} ~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; {17604#(< ~counter~0 18)} is VALID [2022-04-27 13:05:16,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {17604#(< ~counter~0 18)} assume !(~c~0 >= ~b~0); {17604#(< ~counter~0 18)} is VALID [2022-04-27 13:05:16,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {17604#(< ~counter~0 18)} is VALID [2022-04-27 13:05:16,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {17617#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17604#(< ~counter~0 18)} is VALID [2022-04-27 13:05:16,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {17617#(< ~counter~0 17)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17617#(< ~counter~0 17)} is VALID [2022-04-27 13:05:16,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {17617#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {17617#(< ~counter~0 17)} is VALID [2022-04-27 13:05:16,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {17627#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17617#(< ~counter~0 17)} is VALID [2022-04-27 13:05:16,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {17627#(< ~counter~0 16)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17410#true} {17627#(< ~counter~0 16)} #96#return; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 13:05:16,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L272 TraceCheckUtils]: 11: Hoare triple {17627#(< ~counter~0 16)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17410#true} {17627#(< ~counter~0 16)} #94#return; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {17627#(< ~counter~0 16)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17410#true} is VALID [2022-04-27 13:05:16,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {17627#(< ~counter~0 16)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {17627#(< ~counter~0 16)} call #t~ret9 := main(); {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17627#(< ~counter~0 16)} {17410#true} #108#return; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {17627#(< ~counter~0 16)} assume true; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#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; {17627#(< ~counter~0 16)} is VALID [2022-04-27 13:05:16,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} call ULTIMATE.init(); {17410#true} is VALID [2022-04-27 13:05:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:05:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:16,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508313999] [2022-04-27 13:05:16,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:16,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361920262] [2022-04-27 13:05:16,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361920262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:16,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:16,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:05:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320342953] [2022-04-27 13:05:16,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-27 13:05:16,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:16,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:16,558 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 13:05:16,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:05:16,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:16,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:05:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:05:16,559 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:19,286 INFO L93 Difference]: Finished difference Result 1597 states and 2379 transitions. [2022-04-27 13:05:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 13:05:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-27 13:05:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2022-04-27 13:05:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2022-04-27 13:05:19,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 281 transitions. [2022-04-27 13:05:19,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:19,610 INFO L225 Difference]: With dead ends: 1597 [2022-04-27 13:05:19,610 INFO L226 Difference]: Without dead ends: 1119 [2022-04-27 13:05:19,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:05:19,612 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 237 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:19,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 405 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:05:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-04-27 13:05:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-04-27 13:05:21,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:21,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-27 13:05:21,383 INFO L74 IsIncluded]: Start isIncluded. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-27 13:05:21,384 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-27 13:05:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:21,448 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-27 13:05:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-27 13:05:21,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:21,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:21,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-27 13:05:21,455 INFO L87 Difference]: Start difference. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-27 13:05:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:21,520 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-27 13:05:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-27 13:05:21,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:21,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:21,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:21,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-27 13:05:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-04-27 13:05:21,610 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-04-27 13:05:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:21,610 INFO L495 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-04-27 13:05:21,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-04-27 13:05:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 13:05:21,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:21,611 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-04-27 13:05:21,634 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 13:05:21,827 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 13:05:21,827 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1262965884, now seen corresponding path program 2 times [2022-04-27 13:05:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:21,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121364396] [2022-04-27 13:05:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:21,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032168557] [2022-04-27 13:05:21,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:05:21,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:21,851 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 13:05:21,878 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 13:05:21,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:05:21,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:05:21,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:05:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:21,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:22,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {23972#true} call ULTIMATE.init(); {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {23972#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; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {23972#true} assume true; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23972#true} {23972#true} #108#return; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {23972#true} call #t~ret9 := main(); {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {23972#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;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; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {23972#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {23972#true} ~cond := #in~cond; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {23972#true} assume !(0 == ~cond); {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {23972#true} assume true; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23972#true} {23972#true} #94#return; {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {23972#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23972#true} is VALID [2022-04-27 13:05:22,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {23972#true} ~cond := #in~cond; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {23972#true} assume !(0 == ~cond); {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {23972#true} assume true; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23972#true} {23972#true} #96#return; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {23972#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {23972#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {23972#true} assume !!(#t~post6 < 20);havoc #t~post6; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {23972#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {23972#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {23972#true} assume !!(#t~post7 < 20);havoc #t~post7; {23972#true} is VALID [2022-04-27 13:05:22,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {23972#true} assume !(~c~0 >= ~b~0); {24043#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:05:22,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {24043#(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; {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:05:22,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {24047#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:05:22,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {24047#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 20);havoc #t~post6; {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:05:22,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {24047#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:05:22,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {24057#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:05:22,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {24057#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 20);havoc #t~post7; {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {24057#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {23973#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; {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {23973#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {23973#false} assume !!(#t~post6 < 20);havoc #t~post6; {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {23973#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {23973#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {23973#false} assume !!(#t~post7 < 20);havoc #t~post7; {23973#false} is VALID [2022-04-27 13:05:22,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {23973#false} assume !(~c~0 >= ~b~0); {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {23973#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; {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {23973#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {23973#false} assume !(#t~post6 < 20);havoc #t~post6; {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L272 TraceCheckUtils]: 40: Hoare triple {23973#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {23973#false} ~cond := #in~cond; {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {23973#false} assume 0 == ~cond; {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {23973#false} assume !false; {23973#false} is VALID [2022-04-27 13:05:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 13:05:22,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:05:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121364396] [2022-04-27 13:05:22,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032168557] [2022-04-27 13:05:22,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032168557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:05:22,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:05:22,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:05:22,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568297180] [2022-04-27 13:05:22,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:05:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-27 13:05:22,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:22,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:05:22,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:22,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:05:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:05:22,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:05:22,078 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:05:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:24,810 INFO L93 Difference]: Finished difference Result 1700 states and 2539 transitions. [2022-04-27 13:05:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:05:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-27 13:05:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:05:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 13:05:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:05:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 13:05:24,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-27 13:05:24,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:25,021 INFO L225 Difference]: With dead ends: 1700 [2022-04-27 13:05:25,021 INFO L226 Difference]: Without dead ends: 1234 [2022-04-27 13:05:25,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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 13:05:25,024 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:25,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 170 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:05:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-04-27 13:05:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-04-27 13:05:26,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:26,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-27 13:05:26,750 INFO L74 IsIncluded]: Start isIncluded. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-27 13:05:26,751 INFO L87 Difference]: Start difference. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-27 13:05:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:26,839 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-27 13:05:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-27 13:05:26,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:26,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:26,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-27 13:05:26,847 INFO L87 Difference]: Start difference. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-27 13:05:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:26,938 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-27 13:05:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-27 13:05:26,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:26,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:26,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:26,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-27 13:05:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-04-27 13:05:27,022 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-04-27 13:05:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:27,022 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-04-27 13:05:27,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:05:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-04-27 13:05:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 13:05:27,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:27,023 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:27,046 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 13:05:27,239 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 13:05:27,239 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-27 13:05:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:27,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996268368] [2022-04-27 13:05:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:27,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:27,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349240785] [2022-04-27 13:05:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:27,311 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 13:05:27,337 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 13:05:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:27,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-27 13:05:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:27,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:28,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {30652#true} call ULTIMATE.init(); {30652#true} is VALID [2022-04-27 13:05:28,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {30652#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; {30652#true} is VALID [2022-04-27 13:05:28,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30652#true} {30652#true} #108#return; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {30652#true} call #t~ret9 := main(); {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {30652#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;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; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {30652#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30652#true} {30652#true} #94#return; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {30652#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:05:28,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30652#true} {30652#true} #96#return; {30652#true} is VALID [2022-04-27 13:05:28,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {30652#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30705#(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:28,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {30705#(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; {30705#(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:28,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {30705#(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; {30705#(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:28,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {30705#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30715#(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:28,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {30715#(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; {30715#(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:28,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {30715#(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; {30715#(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:28,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {30715#(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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,376 INFO L272 TraceCheckUtils]: 25: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= 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)); {30652#true} is VALID [2022-04-27 13:05:28,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {30652#true} ~cond := #in~cond; {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:28,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:28,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:28,378 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30725#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,378 INFO L272 TraceCheckUtils]: 30: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {30652#true} is VALID [2022-04-27 13:05:28,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {30652#true} ~cond := #in~cond; {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:28,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:28,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:28,380 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,380 INFO L272 TraceCheckUtils]: 35: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {30652#true} is VALID [2022-04-27 13:05:28,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:05:28,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:05:28,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:05:28,381 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30652#true} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,381 INFO L272 TraceCheckUtils]: 40: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30652#true} is VALID [2022-04-27 13:05:28,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:05:28,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:05:28,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:05:28,382 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30652#true} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:28,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= 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; {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:28,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:28,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:28,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !(0 != ~b~0); {30824#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:28,386 INFO L272 TraceCheckUtils]: 54: Hoare triple {30824#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:28,387 INFO L290 TraceCheckUtils]: 55: Hoare triple {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:28,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {30832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30653#false} is VALID [2022-04-27 13:05:28,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {30653#false} assume !false; {30653#false} is VALID [2022-04-27 13:05:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:05:28,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:06:14,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {30653#false} assume !false; {30653#false} is VALID [2022-04-27 13:06:14,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {30832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30653#false} is VALID [2022-04-27 13:06:14,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:06:14,465 INFO L272 TraceCheckUtils]: 54: Hoare triple {30848#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:06:14,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {30848#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:06:14,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:06:14,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:06:14,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:06:14,631 INFO L290 TraceCheckUtils]: 49: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,649 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30652#true} {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:06:14,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:06:14,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:06:14,649 INFO L272 TraceCheckUtils]: 40: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30652#true} is VALID [2022-04-27 13:06:14,650 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30652#true} {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:06:14,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:06:14,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:06:14,650 INFO L272 TraceCheckUtils]: 35: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {30652#true} is VALID [2022-04-27 13:06:14,651 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:14,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:14,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {30652#true} ~cond := #in~cond; {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:06:14,652 INFO L272 TraceCheckUtils]: 30: Hoare triple {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {30652#true} is VALID [2022-04-27 13:06:14,653 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:14,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:14,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {30652#true} ~cond := #in~cond; {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:06:14,654 INFO L272 TraceCheckUtils]: 25: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {30652#true} is VALID [2022-04-27 13:06:14,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 20);havoc #t~post8; {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:06:14,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)))) (not (= main_~c~0 main_~b~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:06:14,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)))) (not (= main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {30652#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {30652#true} assume !!(#t~post6 < 20);havoc #t~post6; {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {30652#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {30652#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30652#true} {30652#true} #96#return; {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {30652#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-27 13:06:14,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30652#true} {30652#true} #94#return; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {30652#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {30652#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;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; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {30652#true} call #t~ret9 := main(); {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30652#true} {30652#true} #108#return; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {30652#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; {30652#true} is VALID [2022-04-27 13:06:14,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {30652#true} call ULTIMATE.init(); {30652#true} is VALID [2022-04-27 13:06:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:06:14,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:06:14,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996268368] [2022-04-27 13:06:14,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:06:14,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349240785] [2022-04-27 13:06:14,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349240785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:06:14,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:06:14,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-27 13:06:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742274994] [2022-04-27 13:06:14,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:06:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-27 13:06:14,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:06:14,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:14,864 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 13:06:14,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 13:06:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:06:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 13:06:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:06:14,865 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:38,342 INFO L93 Difference]: Finished difference Result 1412 states and 2014 transitions. [2022-04-27 13:06:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 13:06:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-27 13:06:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:06:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2022-04-27 13:06:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2022-04-27 13:06:38,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 308 transitions. [2022-04-27 13:06:44,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:44,659 INFO L225 Difference]: With dead ends: 1412 [2022-04-27 13:06:44,659 INFO L226 Difference]: Without dead ends: 1404 [2022-04-27 13:06:44,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 13:06:44,661 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 166 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:06:44,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 669 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-04-27 13:06:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-04-27 13:06:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-04-27 13:06:46,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:06:46,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-27 13:06:46,786 INFO L74 IsIncluded]: Start isIncluded. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-27 13:06:46,787 INFO L87 Difference]: Start difference. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-27 13:06:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:46,889 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-27 13:06:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-27 13:06:46,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:06:46,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:06:46,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-27 13:06:46,898 INFO L87 Difference]: Start difference. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-27 13:06:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:47,001 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-27 13:06:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-27 13:06:47,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:06:47,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:06:47,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:06:47,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:06:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-27 13:06:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-04-27 13:06:47,110 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-04-27 13:06:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:06:47,112 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-04-27 13:06:47,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-04-27 13:06:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 13:06:47,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:06:47,113 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:06:47,138 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 13:06:47,336 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 13:06:47,336 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:06:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:06:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1288112160, now seen corresponding path program 1 times [2022-04-27 13:06:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:06:47,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012308785] [2022-04-27 13:06:47,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:06:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:06:47,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:06:47,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134035373] [2022-04-27 13:06:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:06:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:06:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:06:47,356 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 13:06:47,359 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 13:06:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:06:47,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:06:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:06:47,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:06:47,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {37759#true} call ULTIMATE.init(); {37759#true} is VALID [2022-04-27 13:06:47,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {37759#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; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {37767#(<= ~counter~0 0)} assume true; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37767#(<= ~counter~0 0)} {37759#true} #108#return; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {37767#(<= ~counter~0 0)} call #t~ret9 := main(); {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {37767#(<= ~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;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; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {37767#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {37767#(<= ~counter~0 0)} ~cond := #in~cond; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {37767#(<= ~counter~0 0)} assume !(0 == ~cond); {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {37767#(<= ~counter~0 0)} assume true; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,759 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37767#(<= ~counter~0 0)} {37767#(<= ~counter~0 0)} #94#return; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {37767#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {37767#(<= ~counter~0 0)} ~cond := #in~cond; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {37767#(<= ~counter~0 0)} assume !(0 == ~cond); {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {37767#(<= ~counter~0 0)} assume true; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37767#(<= ~counter~0 0)} {37767#(<= ~counter~0 0)} #96#return; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {37767#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {37767#(<= ~counter~0 0)} is VALID [2022-04-27 13:06:47,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {37767#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37816#(<= ~counter~0 1)} is VALID [2022-04-27 13:06:47,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {37816#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {37816#(<= ~counter~0 1)} is VALID [2022-04-27 13:06:47,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {37816#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37816#(<= ~counter~0 1)} is VALID [2022-04-27 13:06:47,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {37816#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37826#(<= ~counter~0 2)} is VALID [2022-04-27 13:06:47,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {37826#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {37826#(<= ~counter~0 2)} is VALID [2022-04-27 13:06:47,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {37826#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {37826#(<= ~counter~0 2)} is VALID [2022-04-27 13:06:47,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {37826#(<= ~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; {37826#(<= ~counter~0 2)} is VALID [2022-04-27 13:06:47,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {37826#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37839#(<= ~counter~0 3)} is VALID [2022-04-27 13:06:47,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {37839#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {37839#(<= ~counter~0 3)} is VALID [2022-04-27 13:06:47,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {37839#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37839#(<= ~counter~0 3)} is VALID [2022-04-27 13:06:47,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {37839#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37849#(<= ~counter~0 4)} is VALID [2022-04-27 13:06:47,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {37849#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {37849#(<= ~counter~0 4)} is VALID [2022-04-27 13:06:47,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {37849#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {37849#(<= ~counter~0 4)} is VALID [2022-04-27 13:06:47,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {37849#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {37859#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,767 INFO L272 TraceCheckUtils]: 32: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,769 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #98#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,769 INFO L272 TraceCheckUtils]: 37: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,771 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #100#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,771 INFO L272 TraceCheckUtils]: 42: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,773 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #102#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,773 INFO L272 TraceCheckUtils]: 47: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,775 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #104#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {37859#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {37859#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37859#(<= ~counter~0 5)} is VALID [2022-04-27 13:06:47,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {37859#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37932#(<= ~counter~0 6)} is VALID [2022-04-27 13:06:47,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {37932#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {37932#(<= ~counter~0 6)} is VALID [2022-04-27 13:06:47,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {37932#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {37932#(<= ~counter~0 6)} is VALID [2022-04-27 13:06:47,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {37932#(<= ~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; {37932#(<= ~counter~0 6)} is VALID [2022-04-27 13:06:47,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {37932#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37945#(<= |main_#t~post6| 6)} is VALID [2022-04-27 13:06:47,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {37945#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {37760#false} is VALID [2022-04-27 13:06:47,777 INFO L272 TraceCheckUtils]: 60: Hoare triple {37760#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {37760#false} is VALID [2022-04-27 13:06:47,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {37760#false} ~cond := #in~cond; {37760#false} is VALID [2022-04-27 13:06:47,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {37760#false} assume 0 == ~cond; {37760#false} is VALID [2022-04-27 13:06:47,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {37760#false} assume !false; {37760#false} is VALID [2022-04-27 13:06:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:06:47,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:06:48,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {37760#false} assume !false; {37760#false} is VALID [2022-04-27 13:06:48,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {37760#false} assume 0 == ~cond; {37760#false} is VALID [2022-04-27 13:06:48,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {37760#false} ~cond := #in~cond; {37760#false} is VALID [2022-04-27 13:06:48,140 INFO L272 TraceCheckUtils]: 60: Hoare triple {37760#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {37760#false} is VALID [2022-04-27 13:06:48,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {37973#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {37760#false} is VALID [2022-04-27 13:06:48,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {37977#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37973#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:06:48,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {37977#(< ~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; {37977#(< ~counter~0 20)} is VALID [2022-04-27 13:06:48,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {37977#(< ~counter~0 20)} assume !(~c~0 >= ~b~0); {37977#(< ~counter~0 20)} is VALID [2022-04-27 13:06:48,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {37977#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {37977#(< ~counter~0 20)} is VALID [2022-04-27 13:06:48,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {37990#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37977#(< ~counter~0 20)} is VALID [2022-04-27 13:06:48,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {37990#(< ~counter~0 19)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {37990#(< ~counter~0 19)} assume !(~c~0 >= 2 * ~v~0); {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,144 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37759#true} {37990#(< ~counter~0 19)} #104#return; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-27 13:06:48,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-27 13:06:48,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-27 13:06:48,144 INFO L272 TraceCheckUtils]: 47: Hoare triple {37990#(< ~counter~0 19)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {37759#true} is VALID [2022-04-27 13:06:48,144 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37759#true} {37990#(< ~counter~0 19)} #102#return; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-27 13:06:48,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-27 13:06:48,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-27 13:06:48,145 INFO L272 TraceCheckUtils]: 42: Hoare triple {37990#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37759#true} is VALID [2022-04-27 13:06:48,145 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37759#true} {37990#(< ~counter~0 19)} #100#return; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-27 13:06:48,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-27 13:06:48,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-27 13:06:48,146 INFO L272 TraceCheckUtils]: 37: Hoare triple {37990#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37759#true} is VALID [2022-04-27 13:06:48,146 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37759#true} {37990#(< ~counter~0 19)} #98#return; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-27 13:06:48,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-27 13:06:48,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-27 13:06:48,147 INFO L272 TraceCheckUtils]: 32: Hoare triple {37990#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37759#true} is VALID [2022-04-27 13:06:48,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {37990#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {38063#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37990#(< ~counter~0 19)} is VALID [2022-04-27 13:06:48,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {38063#(< ~counter~0 18)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {38063#(< ~counter~0 18)} is VALID [2022-04-27 13:06:48,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {38063#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {38063#(< ~counter~0 18)} is VALID [2022-04-27 13:06:48,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {38073#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38063#(< ~counter~0 18)} is VALID [2022-04-27 13:06:48,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {38073#(< ~counter~0 17)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {38073#(< ~counter~0 17)} is VALID [2022-04-27 13:06:48,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {38073#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {38073#(< ~counter~0 17)} is VALID [2022-04-27 13:06:48,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {38083#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38073#(< ~counter~0 17)} is VALID [2022-04-27 13:06:48,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {38083#(< ~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; {38083#(< ~counter~0 16)} is VALID [2022-04-27 13:06:48,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {38083#(< ~counter~0 16)} assume !(~c~0 >= ~b~0); {38083#(< ~counter~0 16)} is VALID [2022-04-27 13:06:48,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {38083#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {38083#(< ~counter~0 16)} is VALID [2022-04-27 13:06:48,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {38096#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38083#(< ~counter~0 16)} is VALID [2022-04-27 13:06:48,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {38096#(< ~counter~0 15)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {38096#(< ~counter~0 15)} is VALID [2022-04-27 13:06:48,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {38096#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {38096#(< ~counter~0 15)} is VALID [2022-04-27 13:06:48,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {38106#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38096#(< ~counter~0 15)} is VALID [2022-04-27 13:06:48,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {38106#(< ~counter~0 14)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37759#true} {38106#(< ~counter~0 14)} #96#return; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-27 13:06:48,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-27 13:06:48,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-27 13:06:48,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {38106#(< ~counter~0 14)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37759#true} is VALID [2022-04-27 13:06:48,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37759#true} {38106#(< ~counter~0 14)} #94#return; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-27 13:06:48,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-27 13:06:48,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-27 13:06:48,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {38106#(< ~counter~0 14)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37759#true} is VALID [2022-04-27 13:06:48,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {38106#(< ~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;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; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {38106#(< ~counter~0 14)} call #t~ret9 := main(); {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38106#(< ~counter~0 14)} {37759#true} #108#return; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {38106#(< ~counter~0 14)} assume true; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {37759#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; {38106#(< ~counter~0 14)} is VALID [2022-04-27 13:06:48,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {37759#true} call ULTIMATE.init(); {37759#true} is VALID [2022-04-27 13:06:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:06:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:06:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012308785] [2022-04-27 13:06:48,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:06:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134035373] [2022-04-27 13:06:48,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134035373] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:06:48,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:06:48,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 13:06:48,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314561427] [2022-04-27 13:06:48,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:06:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-27 13:06:48,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:06:48,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:06:48,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:48,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:06:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:06:48,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:06:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:06:48,254 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:06:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:54,089 INFO L93 Difference]: Finished difference Result 2565 states and 3679 transitions. [2022-04-27 13:06:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 13:06:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-27 13:06:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:06:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:06:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 367 transitions. [2022-04-27 13:06:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:06:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 367 transitions. [2022-04-27 13:06:54,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 367 transitions. [2022-04-27 13:06:54,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:54,667 INFO L225 Difference]: With dead ends: 2565 [2022-04-27 13:06:54,667 INFO L226 Difference]: Without dead ends: 2543 [2022-04-27 13:06:54,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2022-04-27 13:06:54,669 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 337 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:06:54,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 502 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 13:06:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-04-27 13:06:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2406. [2022-04-27 13:06:58,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:06:58,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2543 states. Second operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:06:58,921 INFO L74 IsIncluded]: Start isIncluded. First operand 2543 states. Second operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:06:58,924 INFO L87 Difference]: Start difference. First operand 2543 states. Second operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:06:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:59,198 INFO L93 Difference]: Finished difference Result 2543 states and 3572 transitions. [2022-04-27 13:06:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3572 transitions. [2022-04-27 13:06:59,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:06:59,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:06:59,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2543 states. [2022-04-27 13:06:59,212 INFO L87 Difference]: Start difference. First operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2543 states. [2022-04-27 13:06:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:59,482 INFO L93 Difference]: Finished difference Result 2543 states and 3572 transitions. [2022-04-27 13:06:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3572 transitions. [2022-04-27 13:06:59,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:06:59,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:06:59,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:06:59,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:06:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:06:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3425 transitions. [2022-04-27 13:06:59,854 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3425 transitions. Word has length 64 [2022-04-27 13:06:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:06:59,855 INFO L495 AbstractCegarLoop]: Abstraction has 2406 states and 3425 transitions. [2022-04-27 13:06:59,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:06:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3425 transitions. [2022-04-27 13:06:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 13:06:59,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:06:59,856 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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] [2022-04-27 13:06:59,879 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 13:07:00,076 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 13:07:00,077 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1156119236, now seen corresponding path program 1 times [2022-04-27 13:07:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:00,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090622519] [2022-04-27 13:07:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:00,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:00,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531004920] [2022-04-27 13:07:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:00,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:00,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:00,098 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 13:07:00,124 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 13:07:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:00,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 13:07:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:00,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:00,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {50605#true} call ULTIMATE.init(); {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {50605#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; {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50605#true} {50605#true} #108#return; {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {50605#true} call #t~ret9 := main(); {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {50605#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;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; {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {50605#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {50605#true} {50605#true} #94#return; {50605#true} is VALID [2022-04-27 13:07:00,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {50605#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {50605#true} ~cond := #in~cond; {50646#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:00,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {50646#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {50650#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:00,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {50650#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {50650#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:00,498 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {50650#(not (= |assume_abort_if_not_#in~cond| 0))} {50605#true} #96#return; {50657#(<= 1 main_~y~0)} is VALID [2022-04-27 13:07:00,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {50657#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {50661#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:00,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {50661#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50661#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:00,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {50661#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:00,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50661#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:00,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {50661#(<= 1 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50661#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:00,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(#t~post7 < 20);havoc #t~post7; {50661#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:00,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(#t~post8 < 20);havoc #t~post8; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,501 INFO L272 TraceCheckUtils]: 25: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,502 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #98#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,502 INFO L272 TraceCheckUtils]: 30: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,503 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #100#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,503 INFO L272 TraceCheckUtils]: 35: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,504 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #102#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,504 INFO L272 TraceCheckUtils]: 40: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,505 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #104#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} assume !!(#t~post8 < 20);havoc #t~post8; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,506 INFO L272 TraceCheckUtils]: 48: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,507 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50605#true} {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #98#return; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,507 INFO L272 TraceCheckUtils]: 53: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,508 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {50605#true} {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #100#return; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,508 INFO L272 TraceCheckUtils]: 58: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,509 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {50605#true} {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #102#return; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-27 13:07:00,509 INFO L272 TraceCheckUtils]: 63: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:00,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:00,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {50809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50606#false} is VALID [2022-04-27 13:07:00,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {50606#false} assume !false; {50606#false} is VALID [2022-04-27 13:07:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-27 13:07:00,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:00,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {50606#false} assume !false; {50606#false} is VALID [2022-04-27 13:07:00,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {50809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50606#false} is VALID [2022-04-27 13:07:00,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:00,765 INFO L272 TraceCheckUtils]: 63: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:00,766 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,766 INFO L272 TraceCheckUtils]: 58: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,767 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,767 INFO L272 TraceCheckUtils]: 53: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,768 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,768 INFO L272 TraceCheckUtils]: 48: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 20);havoc #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,772 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,772 INFO L272 TraceCheckUtils]: 40: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,773 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,773 INFO L272 TraceCheckUtils]: 35: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,774 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,774 INFO L272 TraceCheckUtils]: 30: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,775 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,775 INFO L272 TraceCheckUtils]: 25: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 20);havoc #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {50605#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:07:00,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {50605#true} assume !!(#t~post7 < 20);havoc #t~post7; {50605#true} is VALID [2022-04-27 13:07:00,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {50605#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50605#true} is VALID [2022-04-27 13:07:00,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {50605#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50605#true} is VALID [2022-04-27 13:07:00,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {50605#true} assume !!(#t~post6 < 20);havoc #t~post6; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {50605#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {50605#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {50605#true} {50605#true} #96#return; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {50605#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {50605#true} {50605#true} #94#return; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {50605#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-27 13:07:00,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {50605#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;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; {50605#true} is VALID [2022-04-27 13:07:00,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {50605#true} call #t~ret9 := main(); {50605#true} is VALID [2022-04-27 13:07:00,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50605#true} {50605#true} #108#return; {50605#true} is VALID [2022-04-27 13:07:00,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-27 13:07:00,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {50605#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; {50605#true} is VALID [2022-04-27 13:07:00,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {50605#true} call ULTIMATE.init(); {50605#true} is VALID [2022-04-27 13:07:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-27 13:07:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:00,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090622519] [2022-04-27 13:07:00,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531004920] [2022-04-27 13:07:00,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531004920] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:07:00,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:07:00,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-27 13:07:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718186744] [2022-04-27 13:07:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-04-27 13:07:00,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:00,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 13:07:00,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:00,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:00,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:07:00,812 INFO L87 Difference]: Start difference. First operand 2406 states and 3425 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 13:07:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:05,625 INFO L93 Difference]: Finished difference Result 2467 states and 3485 transitions. [2022-04-27 13:07:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:07:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-04-27 13:07:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 13:07:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 13:07:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 13:07:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 13:07:05,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-27 13:07:05,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:05,951 INFO L225 Difference]: With dead ends: 2467 [2022-04-27 13:07:05,952 INFO L226 Difference]: Without dead ends: 2465 [2022-04-27 13:07:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:07:05,954 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:05,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-04-27 13:07:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2442. [2022-04-27 13:07:10,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:10,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2465 states. Second operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:07:10,279 INFO L74 IsIncluded]: Start isIncluded. First operand 2465 states. Second operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:07:10,282 INFO L87 Difference]: Start difference. First operand 2465 states. Second operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:07:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:10,528 INFO L93 Difference]: Finished difference Result 2465 states and 3473 transitions. [2022-04-27 13:07:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3473 transitions. [2022-04-27 13:07:10,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:10,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:10,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2465 states. [2022-04-27 13:07:10,542 INFO L87 Difference]: Start difference. First operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2465 states. [2022-04-27 13:07:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:10,797 INFO L93 Difference]: Finished difference Result 2465 states and 3473 transitions. [2022-04-27 13:07:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3473 transitions. [2022-04-27 13:07:10,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:10,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:10,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:10,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-27 13:07:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3450 transitions. [2022-04-27 13:07:11,220 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3450 transitions. Word has length 67 [2022-04-27 13:07:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:11,220 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3450 transitions. [2022-04-27 13:07:11,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 13:07:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3450 transitions. [2022-04-27 13:07:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 13:07:11,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:11,226 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:11,251 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:07:11,442 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:07:11,442 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -958869778, now seen corresponding path program 1 times [2022-04-27 13:07:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:11,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782779631] [2022-04-27 13:07:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:11,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:11,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389983719] [2022-04-27 13:07:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:11,455 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:07:11,458 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:07:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:11,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:07:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:11,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:11,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {63174#true} call ULTIMATE.init(); {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {63174#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; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63174#true} {63174#true} #108#return; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {63174#true} call #t~ret9 := main(); {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {63174#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;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; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {63174#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63174#true} {63174#true} #94#return; {63174#true} is VALID [2022-04-27 13:07:11,738 INFO L272 TraceCheckUtils]: 11: Hoare triple {63174#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {63174#true} {63174#true} #96#return; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {63174#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {63174#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {63174#true} assume !!(#t~post6 < 20);havoc #t~post6; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {63174#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {63174#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {63174#true} assume !!(#t~post7 < 20);havoc #t~post7; {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {63174#true} assume !(~c~0 >= ~b~0); {63174#true} is VALID [2022-04-27 13:07:11,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {63174#true} ~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; {63174#true} is VALID [2022-04-27 13:07:11,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {63174#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {63174#true} is VALID [2022-04-27 13:07:11,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {63174#true} assume !!(#t~post6 < 20);havoc #t~post6; {63174#true} is VALID [2022-04-27 13:07:11,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {63174#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {63174#true} is VALID [2022-04-27 13:07:11,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {63174#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {63174#true} is VALID [2022-04-27 13:07:11,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {63174#true} assume !!(#t~post7 < 20);havoc #t~post7; {63174#true} is VALID [2022-04-27 13:07:11,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {63174#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {63266#(<= main_~v~0 main_~b~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {63266#(<= main_~v~0 main_~b~0)} assume !!(#t~post8 < 20);havoc #t~post8; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,741 INFO L272 TraceCheckUtils]: 32: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {63174#true} is VALID [2022-04-27 13:07:11,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-27 13:07:11,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-27 13:07:11,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,742 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #98#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,742 INFO L272 TraceCheckUtils]: 37: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {63174#true} is VALID [2022-04-27 13:07:11,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-27 13:07:11,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-27 13:07:11,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,743 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #100#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,743 INFO L272 TraceCheckUtils]: 42: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {63174#true} is VALID [2022-04-27 13:07:11,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-27 13:07:11,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-27 13:07:11,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,744 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #102#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,744 INFO L272 TraceCheckUtils]: 47: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {63174#true} is VALID [2022-04-27 13:07:11,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-27 13:07:11,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-27 13:07:11,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-27 13:07:11,745 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #104#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:07:11,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {63266#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {63336#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:07:11,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {63336#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {63340#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:07:11,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {63340#(< main_~c~0 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {63340#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:07:11,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {63340#(< main_~c~0 main_~b~0)} assume !!(#t~post7 < 20);havoc #t~post7; {63340#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:07:11,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {63340#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {63175#false} is VALID [2022-04-27 13:07:11,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {63175#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {63175#false} is VALID [2022-04-27 13:07:11,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {63175#false} assume !!(#t~post8 < 20);havoc #t~post8; {63175#false} is VALID [2022-04-27 13:07:11,747 INFO L272 TraceCheckUtils]: 59: Hoare triple {63175#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {63175#false} is VALID [2022-04-27 13:07:11,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {63175#false} ~cond := #in~cond; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {63175#false} assume !(0 == ~cond); {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {63175#false} assume true; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {63175#false} {63175#false} #98#return; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L272 TraceCheckUtils]: 64: Hoare triple {63175#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 65: Hoare triple {63175#false} ~cond := #in~cond; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 66: Hoare triple {63175#false} assume !(0 == ~cond); {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 67: Hoare triple {63175#false} assume true; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {63175#false} {63175#false} #100#return; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L272 TraceCheckUtils]: 69: Hoare triple {63175#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {63175#false} ~cond := #in~cond; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {63175#false} assume 0 == ~cond; {63175#false} is VALID [2022-04-27 13:07:11,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {63175#false} assume !false; {63175#false} is VALID [2022-04-27 13:07:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 13:07:11,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782779631] [2022-04-27 13:07:11,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389983719] [2022-04-27 13:07:11,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389983719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:11,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:11,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:07:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578385551] [2022-04-27 13:07:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:11,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-27 13:07:11,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:11,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:07:11,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:07:11,792 INFO L87 Difference]: Start difference. First operand 2442 states and 3450 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:07:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:16,886 INFO L93 Difference]: Finished difference Result 4377 states and 6175 transitions. [2022-04-27 13:07:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:07:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-27 13:07:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:07:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 13:07:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:07:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 13:07:16,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-27 13:07:16,962 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 13:07:17,298 INFO L225 Difference]: With dead ends: 4377 [2022-04-27 13:07:17,298 INFO L226 Difference]: Without dead ends: 2578 [2022-04-27 13:07:17,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:07:17,305 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:17,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-04-27 13:07:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2372. [2022-04-27 13:07:21,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:21,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2578 states. Second operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:07:21,235 INFO L74 IsIncluded]: Start isIncluded. First operand 2578 states. Second operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:07:21,237 INFO L87 Difference]: Start difference. First operand 2578 states. Second operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:07:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,498 INFO L93 Difference]: Finished difference Result 2578 states and 3563 transitions. [2022-04-27 13:07:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3563 transitions. [2022-04-27 13:07:21,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:21,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:21,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) Second operand 2578 states. [2022-04-27 13:07:21,512 INFO L87 Difference]: Start difference. First operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) Second operand 2578 states. [2022-04-27 13:07:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,795 INFO L93 Difference]: Finished difference Result 2578 states and 3563 transitions. [2022-04-27 13:07:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3563 transitions. [2022-04-27 13:07:21,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:21,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:21,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:21,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:07:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3297 transitions. [2022-04-27 13:07:22,103 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3297 transitions. Word has length 73 [2022-04-27 13:07:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:22,103 INFO L495 AbstractCegarLoop]: Abstraction has 2372 states and 3297 transitions. [2022-04-27 13:07:22,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:07:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3297 transitions. [2022-04-27 13:07:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 13:07:22,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:22,104 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 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 13:07:22,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-27 13:07:22,304 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:07:22,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -705069158, now seen corresponding path program 2 times [2022-04-27 13:07:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:22,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727793504] [2022-04-27 13:07:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:22,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767114798] [2022-04-27 13:07:22,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:07:22,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:22,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:22,327 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:07:22,333 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:07:22,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:07:22,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:07:22,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-27 13:07:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:22,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:24,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {78332#true} call ULTIMATE.init(); {78332#true} is VALID [2022-04-27 13:07:24,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {78332#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; {78332#true} is VALID [2022-04-27 13:07:24,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:07:24,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78332#true} {78332#true} #108#return; {78332#true} is VALID [2022-04-27 13:07:24,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {78332#true} call #t~ret9 := main(); {78332#true} is VALID [2022-04-27 13:07:24,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {78332#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;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; {78332#true} is VALID [2022-04-27 13:07:24,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {78332#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:07:24,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:07:24,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:07:24,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:07:24,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78332#true} {78332#true} #94#return; {78332#true} is VALID [2022-04-27 13:07:24,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {78332#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:07:24,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {78332#true} ~cond := #in~cond; {78373#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:24,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {78373#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {78377#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:24,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {78377#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {78377#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:24,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78377#(not (= |assume_abort_if_not_#in~cond| 0))} {78332#true} #96#return; {78384#(<= 1 main_~y~0)} is VALID [2022-04-27 13:07:24,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {78384#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~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; {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {78408#(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) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {78408#(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) (<= 1 main_~y~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; {78412#(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) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {78412#(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) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78412#(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) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {78412#(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) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {78412#(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) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {78412#(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) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78422#(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) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {78422#(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) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78422#(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) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {78422#(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) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {78422#(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) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {78422#(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) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post8 < 20);havoc #t~post8; {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:24,160 INFO L272 TraceCheckUtils]: 32: Hoare triple {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:07:24,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {78332#true} ~cond := #in~cond; {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:24,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:24,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:24,163 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78432#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} #98#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,164 INFO L272 TraceCheckUtils]: 37: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:07:24,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:07:24,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:07:24,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:07:24,165 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {78332#true} {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,165 INFO L272 TraceCheckUtils]: 42: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~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)); {78332#true} is VALID [2022-04-27 13:07:24,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:07:24,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:07:24,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:07:24,166 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {78332#true} {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,166 INFO L272 TraceCheckUtils]: 47: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:07:24,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:07:24,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:07:24,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:07:24,167 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {78332#true} {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {78505#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {78505#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:07:24,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~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; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:24,178 INFO L272 TraceCheckUtils]: 66: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:07:24,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {78332#true} ~cond := #in~cond; {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:24,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:24,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:24,180 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #98#return; {78562#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-27 13:07:24,180 INFO L272 TraceCheckUtils]: 71: Hoare triple {78562#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:24,181 INFO L290 TraceCheckUtils]: 72: Hoare triple {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {78570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:24,181 INFO L290 TraceCheckUtils]: 73: Hoare triple {78570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {78333#false} is VALID [2022-04-27 13:07:24,181 INFO L290 TraceCheckUtils]: 74: Hoare triple {78333#false} assume !false; {78333#false} is VALID [2022-04-27 13:07:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 13:07:24,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:26,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {78333#false} assume !false; {78333#false} is VALID [2022-04-27 13:08:26,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {78570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {78333#false} is VALID [2022-04-27 13:08:26,515 INFO L290 TraceCheckUtils]: 72: Hoare triple {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {78570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:26,515 INFO L272 TraceCheckUtils]: 71: Hoare triple {78586#(= 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)); {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:26,516 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #98#return; {78586#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:26,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:26,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:26,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {78332#true} ~cond := #in~cond; {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:08:26,520 INFO L272 TraceCheckUtils]: 66: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {78332#true} is VALID [2022-04-27 13:08:26,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post8 < 20);havoc #t~post8; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post6 < 20);havoc #t~post6; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {78631#(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)))))} ~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; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:08:26,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {78631#(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 !(~c~0 >= ~b~0); {78631#(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 13:08:26,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {78631#(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; {78631#(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 13:08:26,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {78631#(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; {78631#(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 13:08:26,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {78644#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {78631#(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 13:08:26,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= 2 * ~v~0); {78644#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:08:26,549 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {78332#true} {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #104#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:08:26,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:08:26,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:08:26,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:08:26,549 INFO L272 TraceCheckUtils]: 47: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:08:26,550 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {78332#true} {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #102#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:08:26,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:08:26,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:08:26,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:08:26,551 INFO L272 TraceCheckUtils]: 42: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) 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)); {78332#true} is VALID [2022-04-27 13:08:26,562 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {78332#true} {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #100#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:08:26,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:08:26,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:08:26,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:08:26,562 INFO L272 TraceCheckUtils]: 37: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) 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)); {78332#true} is VALID [2022-04-27 13:08:26,563 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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)))))} #98#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:08:26,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:26,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:26,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {78332#true} ~cond := #in~cond; {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:08:26,565 INFO L272 TraceCheckUtils]: 32: Hoare triple {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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 __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:08:26,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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~post8 < 20);havoc #t~post8; {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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 13:08:26,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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 13:08:26,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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))) (not (= 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 !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= 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 13:08:26,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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))) (not (= 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~post7 < 20);havoc #t~post7; {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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))) (not (= 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 13:08:26,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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))) (not (= 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~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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))) (not (= 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 13:08:26,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {78332#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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))) (not (= 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 13:08:26,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {78332#true} assume !!(#t~post6 < 20);havoc #t~post6; {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {78332#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {78332#true} ~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; {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {78332#true} assume !(~c~0 >= ~b~0); {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {78332#true} assume !!(#t~post7 < 20);havoc #t~post7; {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {78332#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {78332#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78332#true} is VALID [2022-04-27 13:08:26,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {78332#true} assume !!(#t~post6 < 20);havoc #t~post6; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {78332#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {78332#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78332#true} {78332#true} #96#return; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L272 TraceCheckUtils]: 11: Hoare triple {78332#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78332#true} {78332#true} #94#return; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-27 13:08:26,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {78332#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {78332#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;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; {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {78332#true} call #t~ret9 := main(); {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78332#true} {78332#true} #108#return; {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {78332#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; {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {78332#true} call ULTIMATE.init(); {78332#true} is VALID [2022-04-27 13:08:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 13:08:26,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:26,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727793504] [2022-04-27 13:08:26,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:26,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767114798] [2022-04-27 13:08:26,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767114798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:26,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:26,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-04-27 13:08:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427072956] [2022-04-27 13:08:26,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-27 13:08:26,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:26,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:08:26,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:26,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 13:08:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 13:08:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-04-27 13:08:26,758 INFO L87 Difference]: Start difference. First operand 2372 states and 3297 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:09:00,016 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:09:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:09:03,724 INFO L93 Difference]: Finished difference Result 2869 states and 3894 transitions. [2022-04-27 13:09:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 13:09:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-27 13:09:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:09:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:09:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 245 transitions. [2022-04-27 13:09:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:09:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 245 transitions. [2022-04-27 13:09:03,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 245 transitions. [2022-04-27 13:09:04,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:09:04,748 INFO L225 Difference]: With dead ends: 2869 [2022-04-27 13:09:04,748 INFO L226 Difference]: Without dead ends: 2863 [2022-04-27 13:09:04,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 13:09:04,750 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 285 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 286 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:09:04,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 746 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1325 Invalid, 1 Unknown, 0 Unchecked, 12.2s Time] [2022-04-27 13:09:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-04-27 13:09:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2736. [2022-04-27 13:09:09,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:09:09,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2863 states. Second operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-27 13:09:09,574 INFO L74 IsIncluded]: Start isIncluded. First operand 2863 states. Second operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-27 13:09:09,576 INFO L87 Difference]: Start difference. First operand 2863 states. Second operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-27 13:09:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:09:09,813 INFO L93 Difference]: Finished difference Result 2863 states and 3880 transitions. [2022-04-27 13:09:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3880 transitions. [2022-04-27 13:09:09,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:09:09,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:09:09,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) Second operand 2863 states. [2022-04-27 13:09:09,824 INFO L87 Difference]: Start difference. First operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) Second operand 2863 states. [2022-04-27 13:09:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:09:10,057 INFO L93 Difference]: Finished difference Result 2863 states and 3880 transitions. [2022-04-27 13:09:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3880 transitions. [2022-04-27 13:09:10,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:09:10,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:09:10,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:09:10,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:09:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-27 13:09:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3745 transitions. [2022-04-27 13:09:10,386 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3745 transitions. Word has length 75 [2022-04-27 13:09:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:09:10,386 INFO L495 AbstractCegarLoop]: Abstraction has 2736 states and 3745 transitions. [2022-04-27 13:09:10,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:09:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3745 transitions. [2022-04-27 13:09:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 13:09:10,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:09:10,387 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:09:10,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-27 13:09:10,603 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:09:10,603 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:09:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:09:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523945, now seen corresponding path program 1 times [2022-04-27 13:09:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:09:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442226889] [2022-04-27 13:09:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:09:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:09:10,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:09:10,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863337455] [2022-04-27 13:09:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:09:10,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:09:10,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:09:10,617 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:09:10,617 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:09:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:09:10,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-27 13:09:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:09:10,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:09:12,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {92629#true} call ULTIMATE.init(); {92629#true} is VALID [2022-04-27 13:09:12,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {92629#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; {92629#true} is VALID [2022-04-27 13:09:12,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92629#true} {92629#true} #108#return; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {92629#true} call #t~ret9 := main(); {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {92629#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;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; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {92629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92629#true} {92629#true} #94#return; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {92629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92629#true} {92629#true} #96#return; {92629#true} is VALID [2022-04-27 13:09:12,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {92629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92682#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:09:12,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {92682#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92682#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:09:12,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {92682#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {92682#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:09:12,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {92682#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92692#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:09:12,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {92692#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92692#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:09:12,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {92692#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 20);havoc #t~post7; {92692#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:09:12,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {92692#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {92702#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:09:12,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {92702#(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_~p~0 1) (= 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; {92706#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:09:12,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {92706#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92706#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:09:12,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {92706#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {92706#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:09:12,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {92706#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92716#(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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:09:12,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {92716#(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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92716#(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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:09:12,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {92716#(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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 20);havoc #t~post7; {92716#(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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:09:12,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {92716#(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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,920 INFO L272 TraceCheckUtils]: 32: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,921 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {92629#true} {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #98#return; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,921 INFO L272 TraceCheckUtils]: 37: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,922 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {92629#true} {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #100#return; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,922 INFO L272 TraceCheckUtils]: 42: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,924 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {92629#true} {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,924 INFO L272 TraceCheckUtils]: 47: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,925 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {92629#true} {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #104#return; {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:09:12,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {92726#(and (= main_~b~0 main_~v~0) (= 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_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-27 13:09:12,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-27 13:09:12,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} assume !!(#t~post8 < 20);havoc #t~post8; {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-27 13:09:12,926 INFO L272 TraceCheckUtils]: 55: Hoare triple {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {92629#true} ~cond := #in~cond; {92809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:12,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {92809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:12,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:12,929 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} {92796#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} #98#return; {92820#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,929 INFO L272 TraceCheckUtils]: 60: Hoare triple {92820#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {92629#true} ~cond := #in~cond; {92809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:12,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {92809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:12,930 INFO L290 TraceCheckUtils]: 63: Hoare triple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:12,931 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} {92820#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,931 INFO L272 TraceCheckUtils]: 65: Hoare triple {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~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)); {92629#true} is VALID [2022-04-27 13:09:12,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:09:12,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:09:12,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:09:12,932 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {92629#true} {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,932 INFO L272 TraceCheckUtils]: 70: Hoare triple {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:09:12,932 INFO L290 TraceCheckUtils]: 71: Hoare triple {92629#true} ~cond := #in~cond; {92809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:12,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {92809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:12,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:12,933 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {92836#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92873#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {92873#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92873#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,936 INFO L290 TraceCheckUtils]: 78: Hoare triple {92873#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {92873#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {92873#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {92883#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:09:12,938 INFO L290 TraceCheckUtils]: 80: Hoare triple {92883#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~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; {92887#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-27 13:09:12,938 INFO L290 TraceCheckUtils]: 81: Hoare triple {92887#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92887#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-27 13:09:12,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {92887#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {92887#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-27 13:09:12,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {92887#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !(0 != ~b~0); {92897#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-27 13:09:12,941 INFO L272 TraceCheckUtils]: 84: Hoare triple {92897#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {92901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:09:12,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {92901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:12,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {92905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92630#false} is VALID [2022-04-27 13:09:12,942 INFO L290 TraceCheckUtils]: 87: Hoare triple {92630#false} assume !false; {92630#false} is VALID [2022-04-27 13:09:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-27 13:09:12,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:10:18,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {92630#false} assume !false; {92630#false} is VALID [2022-04-27 13:10:18,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {92905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92630#false} is VALID [2022-04-27 13:10:18,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {92901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:18,858 INFO L272 TraceCheckUtils]: 84: Hoare triple {92921#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {92901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:10:18,859 INFO L290 TraceCheckUtils]: 83: Hoare triple {92925#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {92921#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:10:18,859 INFO L290 TraceCheckUtils]: 82: Hoare triple {92925#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {92925#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:10:18,859 INFO L290 TraceCheckUtils]: 81: Hoare triple {92925#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92925#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:10:19,002 INFO L290 TraceCheckUtils]: 80: Hoare triple {92935#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {92925#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:10:19,003 INFO L290 TraceCheckUtils]: 79: Hoare triple {92939#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {92935#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,004 INFO L290 TraceCheckUtils]: 78: Hoare triple {92939#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {92939#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {92939#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92939#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {92949#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92939#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,279 INFO L290 TraceCheckUtils]: 75: Hoare triple {92949#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {92949#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,281 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} {92956#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {92949#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:19,281 INFO L290 TraceCheckUtils]: 72: Hoare triple {92966#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:19,281 INFO L290 TraceCheckUtils]: 71: Hoare triple {92629#true} ~cond := #in~cond; {92966#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:10:19,282 INFO L272 TraceCheckUtils]: 70: Hoare triple {92956#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,282 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {92629#true} {92956#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {92956#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,283 INFO L272 TraceCheckUtils]: 65: Hoare triple {92956#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {92629#true} is VALID [2022-04-27 13:10:19,283 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} {92988#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {92956#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:19,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {92966#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:19,284 INFO L290 TraceCheckUtils]: 61: Hoare triple {92629#true} ~cond := #in~cond; {92966#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:10:19,284 INFO L272 TraceCheckUtils]: 60: Hoare triple {92988#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {92629#true} is VALID [2022-04-27 13:10:19,286 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {92988#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:19,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {92966#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {92813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:19,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {92629#true} ~cond := #in~cond; {92966#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:10:19,287 INFO L272 TraceCheckUtils]: 55: Hoare triple {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {92629#true} is VALID [2022-04-27 13:10:19,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 20);havoc #t~post8; {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,307 INFO L290 TraceCheckUtils]: 52: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {93004#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:19,307 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {92629#true} {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #104#return; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,308 INFO L272 TraceCheckUtils]: 47: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,308 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {92629#true} {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #102#return; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,309 INFO L272 TraceCheckUtils]: 42: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,309 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {92629#true} {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #100#return; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,310 INFO L272 TraceCheckUtils]: 37: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,310 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {92629#true} {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #98#return; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,311 INFO L272 TraceCheckUtils]: 32: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} assume !!(#t~post8 < 20);havoc #t~post8; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {93096#(or (not (= 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)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {93026#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= 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)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-27 13:10:19,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {93096#(or (not (= 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)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {93096#(or (not (= 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)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-27 13:10:19,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {93096#(or (not (= 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)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {93096#(or (not (= 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)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {92629#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {93096#(or (not (= 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)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {92629#true} assume !!(#t~post6 < 20);havoc #t~post6; {92629#true} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {92629#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92629#true} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {92629#true} ~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; {92629#true} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {92629#true} assume !(~c~0 >= ~b~0); {92629#true} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {92629#true} assume !!(#t~post7 < 20);havoc #t~post7; {92629#true} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {92629#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92629#true} is VALID [2022-04-27 13:10:19,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {92629#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {92629#true} assume !!(#t~post6 < 20);havoc #t~post6; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {92629#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {92629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92629#true} {92629#true} #96#return; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L272 TraceCheckUtils]: 11: Hoare triple {92629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92629#true} {92629#true} #94#return; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {92629#true} assume !(0 == ~cond); {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {92629#true} ~cond := #in~cond; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {92629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {92629#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;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; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {92629#true} call #t~ret9 := main(); {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92629#true} {92629#true} #108#return; {92629#true} is VALID [2022-04-27 13:10:19,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {92629#true} assume true; {92629#true} is VALID [2022-04-27 13:10:19,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {92629#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; {92629#true} is VALID [2022-04-27 13:10:19,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {92629#true} call ULTIMATE.init(); {92629#true} is VALID [2022-04-27 13:10:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-27 13:10:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:10:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442226889] [2022-04-27 13:10:19,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:10:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863337455] [2022-04-27 13:10:19,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863337455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:10:19,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:10:19,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-27 13:10:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786147457] [2022-04-27 13:10:19,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:10:19,318 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-27 13:10:19,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:10:19,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:10:19,607 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 13:10:19,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 13:10:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:10:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 13:10:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-04-27 13:10:19,608 INFO L87 Difference]: Start difference. First operand 2736 states and 3745 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:10:40,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:10:49,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:07,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:23,927 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:11:42,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:05,753 INFO L93 Difference]: Finished difference Result 3394 states and 4591 transitions. [2022-04-27 13:12:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-27 13:12:05,754 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-27 13:12:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:12:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:12:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 421 transitions. [2022-04-27 13:12:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:12:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 421 transitions. [2022-04-27 13:12:05,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 421 transitions. [2022-04-27 13:12:24,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 415 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-27 13:12:24,876 INFO L225 Difference]: With dead ends: 3394 [2022-04-27 13:12:24,876 INFO L226 Difference]: Without dead ends: 3363 [2022-04-27 13:12:24,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 167 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=1914, Invalid=9428, Unknown=0, NotChecked=0, Total=11342 [2022-04-27 13:12:24,879 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 414 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 548 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:12:24,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 886 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1663 Invalid, 2 Unknown, 0 Unchecked, 26.1s Time] [2022-04-27 13:12:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-04-27 13:12:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3022. [2022-04-27 13:12:31,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:12:31,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3363 states. Second operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:12:31,027 INFO L74 IsIncluded]: Start isIncluded. First operand 3363 states. Second operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:12:31,028 INFO L87 Difference]: Start difference. First operand 3363 states. Second operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:12:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:31,452 INFO L93 Difference]: Finished difference Result 3363 states and 4537 transitions. [2022-04-27 13:12:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4537 transitions. [2022-04-27 13:12:31,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:12:31,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:12:31,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) Second operand 3363 states. [2022-04-27 13:12:31,460 INFO L87 Difference]: Start difference. First operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) Second operand 3363 states. [2022-04-27 13:12:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:31,940 INFO L93 Difference]: Finished difference Result 3363 states and 4537 transitions. [2022-04-27 13:12:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4537 transitions. [2022-04-27 13:12:31,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:12:31,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:12:31,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:12:31,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:12:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:12:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4123 transitions. [2022-04-27 13:12:32,449 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4123 transitions. Word has length 88 [2022-04-27 13:12:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:12:32,449 INFO L495 AbstractCegarLoop]: Abstraction has 3022 states and 4123 transitions. [2022-04-27 13:12:32,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:12:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4123 transitions. [2022-04-27 13:12:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 13:12:32,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:12:32,450 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:12:32,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 13:12:32,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-27 13:12:32,651 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:12:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:12:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 516983514, now seen corresponding path program 3 times [2022-04-27 13:12:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:12:32,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725338103] [2022-04-27 13:12:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:12:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:12:32,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:12:32,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445109123] [2022-04-27 13:12:32,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:12:32,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:12:32,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:12:32,674 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:12:32,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 13:12:32,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:12:32,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:12:32,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 13:12:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:12:32,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:12:33,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {109199#true} call ULTIMATE.init(); {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {109199#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; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109199#true} {109199#true} #108#return; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {109199#true} call #t~ret9 := main(); {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {109199#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;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; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {109199#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109199#true} {109199#true} #94#return; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {109199#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,496 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109199#true} {109199#true} #96#return; {109199#true} is VALID [2022-04-27 13:12:33,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {109199#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {109252#(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:12:33,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {109252#(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; {109252#(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:12:33,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {109252#(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; {109252#(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:12:33,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {109252#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {109262#(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:12:33,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {109262#(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; {109262#(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:12:33,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {109262#(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; {109262#(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:12:33,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {109262#(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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,504 INFO L272 TraceCheckUtils]: 25: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= 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)); {109199#true} is VALID [2022-04-27 13:12:33,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,505 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {109199#true} {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #98#return; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,505 INFO L272 TraceCheckUtils]: 30: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= 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)); {109199#true} is VALID [2022-04-27 13:12:33,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,506 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {109199#true} {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,506 INFO L272 TraceCheckUtils]: 35: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= 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)); {109199#true} is VALID [2022-04-27 13:12:33,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,507 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109199#true} {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,507 INFO L272 TraceCheckUtils]: 40: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,507 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {109199#true} {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {109272#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {109345#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,511 INFO L290 TraceCheckUtils]: 52: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,511 INFO L290 TraceCheckUtils]: 53: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post7 < 20);havoc #t~post7; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post8 < 20);havoc #t~post8; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,513 INFO L272 TraceCheckUtils]: 59: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,514 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109199#true} {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #98#return; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,514 INFO L272 TraceCheckUtils]: 64: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,514 INFO L290 TraceCheckUtils]: 66: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,514 INFO L290 TraceCheckUtils]: 67: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,529 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {109199#true} {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #100#return; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,530 INFO L272 TraceCheckUtils]: 69: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,530 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {109199#true} {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #102#return; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,531 INFO L272 TraceCheckUtils]: 74: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:33,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:33,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:33,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:33,531 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {109199#true} {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #104#return; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(~c~0 >= 2 * ~v~0); {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,533 INFO L290 TraceCheckUtils]: 82: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post7 < 20);havoc #t~post7; {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(~c~0 >= ~b~0); {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:12:33,534 INFO L290 TraceCheckUtils]: 84: Hoare triple {109358#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 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; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,534 INFO L290 TraceCheckUtils]: 85: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,534 INFO L290 TraceCheckUtils]: 86: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,535 INFO L290 TraceCheckUtils]: 87: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,536 INFO L290 TraceCheckUtils]: 89: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,536 INFO L290 TraceCheckUtils]: 90: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,536 INFO L290 TraceCheckUtils]: 91: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,537 INFO L290 TraceCheckUtils]: 92: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:12:33,537 INFO L272 TraceCheckUtils]: 93: Hoare triple {109461#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {109489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:12:33,538 INFO L290 TraceCheckUtils]: 94: Hoare triple {109489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {109493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:12:33,538 INFO L290 TraceCheckUtils]: 95: Hoare triple {109493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {109200#false} is VALID [2022-04-27 13:12:33,538 INFO L290 TraceCheckUtils]: 96: Hoare triple {109200#false} assume !false; {109200#false} is VALID [2022-04-27 13:12:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-27 13:12:33,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:12:34,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {109200#false} assume !false; {109200#false} is VALID [2022-04-27 13:12:34,035 INFO L290 TraceCheckUtils]: 95: Hoare triple {109493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {109200#false} is VALID [2022-04-27 13:12:34,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {109489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {109493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:12:34,036 INFO L272 TraceCheckUtils]: 93: Hoare triple {109509#(= 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)); {109489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:12:34,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,036 INFO L290 TraceCheckUtils]: 91: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,037 INFO L290 TraceCheckUtils]: 90: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,037 INFO L290 TraceCheckUtils]: 89: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,037 INFO L290 TraceCheckUtils]: 88: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,038 INFO L290 TraceCheckUtils]: 87: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {109537#(= 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; {109509#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:12:34,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,041 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {109199#true} {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #104#return; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,041 INFO L290 TraceCheckUtils]: 77: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:34,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:34,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:34,041 INFO L272 TraceCheckUtils]: 74: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:34,042 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {109199#true} {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,042 INFO L290 TraceCheckUtils]: 72: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:34,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:34,042 INFO L290 TraceCheckUtils]: 70: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:34,042 INFO L272 TraceCheckUtils]: 69: Hoare triple {109537#(= 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)); {109199#true} is VALID [2022-04-27 13:12:34,043 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {109199#true} {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #100#return; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:34,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:34,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:34,043 INFO L272 TraceCheckUtils]: 64: Hoare triple {109537#(= 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)); {109199#true} is VALID [2022-04-27 13:12:34,043 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109199#true} {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:34,044 INFO L290 TraceCheckUtils]: 61: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:34,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:34,044 INFO L272 TraceCheckUtils]: 59: Hoare triple {109537#(= 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)); {109199#true} is VALID [2022-04-27 13:12:34,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,045 INFO L290 TraceCheckUtils]: 54: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,046 INFO L290 TraceCheckUtils]: 53: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:34,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:12:36,048 WARN L290 TraceCheckUtils]: 50: Hoare triple {109640#(= (+ (* (+ (* (* 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; {109537#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-27 13:12:36,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {109640#(= (+ (* (+ (* (* 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); {109640#(= (+ (* (+ (* (* 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:12:36,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {109640#(= (+ (* (+ (* (* 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; {109640#(= (+ (* (+ (* (* 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:12:36,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {109640#(= (+ (* (+ (* (* 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; {109640#(= (+ (* (+ (* (* 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:12:38,051 WARN L290 TraceCheckUtils]: 46: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {109640#(= (+ (* (+ (* (* 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 UNKNOWN [2022-04-27 13:12:38,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} assume !(~c~0 >= 2 * ~v~0); {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,052 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {109199#true} {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #104#return; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:38,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:38,053 INFO L272 TraceCheckUtils]: 40: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:38,054 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109199#true} {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #102#return; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:38,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:38,054 INFO L272 TraceCheckUtils]: 35: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:38,055 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {109199#true} {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #100#return; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:38,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:38,055 INFO L272 TraceCheckUtils]: 30: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:38,056 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {109199#true} {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #98#return; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:38,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:38,056 INFO L272 TraceCheckUtils]: 25: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:38,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {109726#(= (+ (* 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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {109653#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:12:38,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {109726#(= (+ (* 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; {109726#(= (+ (* 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:12:38,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {109726#(= (+ (* 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; {109726#(= (+ (* 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:12:38,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {109736#(= (+ 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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {109726#(= (+ (* 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:12:38,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {109736#(= (+ 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; {109736#(= (+ 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:12:38,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {109736#(= (+ 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; {109736#(= (+ 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:12:38,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {109199#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {109736#(= (+ 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:12:38,060 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109199#true} {109199#true} #96#return; {109199#true} is VALID [2022-04-27 13:12:38,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:38,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:38,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {109199#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:38,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109199#true} {109199#true} #94#return; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {109199#true} assume !(0 == ~cond); {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {109199#true} ~cond := #in~cond; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {109199#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {109199#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;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; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {109199#true} call #t~ret9 := main(); {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109199#true} {109199#true} #108#return; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {109199#true} assume true; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {109199#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; {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {109199#true} call ULTIMATE.init(); {109199#true} is VALID [2022-04-27 13:12:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-27 13:12:38,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:12:38,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725338103] [2022-04-27 13:12:38,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:12:38,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445109123] [2022-04-27 13:12:38,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445109123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:12:38,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:12:38,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:12:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988965867] [2022-04-27 13:12:38,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:12:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-04-27 13:12:38,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:12:38,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 13:12:39,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:12:39,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:12:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:12:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:12:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:12:39,045 INFO L87 Difference]: Start difference. First operand 3022 states and 4123 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 13:12:45,030 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:12:48,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:58,246 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:13:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:16,573 INFO L93 Difference]: Finished difference Result 3244 states and 4417 transitions. [2022-04-27 13:13:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:13:16,573 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-04-27 13:13:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 13:13:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 173 transitions. [2022-04-27 13:13:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 13:13:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 173 transitions. [2022-04-27 13:13:16,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 173 transitions. [2022-04-27 13:13:25,975 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 13:13:26,440 INFO L225 Difference]: With dead ends: 3244 [2022-04-27 13:13:26,440 INFO L226 Difference]: Without dead ends: 3232 [2022-04-27 13:13:26,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-04-27 13:13:26,441 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 110 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 148 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:26,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 532 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 679 Invalid, 2 Unknown, 0 Unchecked, 17.8s Time] [2022-04-27 13:13:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-04-27 13:13:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2949. [2022-04-27 13:13:32,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:32,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3232 states. Second operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:13:32,482 INFO L74 IsIncluded]: Start isIncluded. First operand 3232 states. Second operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:13:32,484 INFO L87 Difference]: Start difference. First operand 3232 states. Second operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:13:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:32,901 INFO L93 Difference]: Finished difference Result 3232 states and 4401 transitions. [2022-04-27 13:13:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4401 transitions. [2022-04-27 13:13:32,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:32,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:32,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) Second operand 3232 states. [2022-04-27 13:13:32,909 INFO L87 Difference]: Start difference. First operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) Second operand 3232 states. [2022-04-27 13:13:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:33,225 INFO L93 Difference]: Finished difference Result 3232 states and 4401 transitions. [2022-04-27 13:13:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4401 transitions. [2022-04-27 13:13:33,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:33,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:33,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:33,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-27 13:13:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4028 transitions. [2022-04-27 13:13:33,601 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4028 transitions. Word has length 97 [2022-04-27 13:13:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:33,602 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 4028 transitions. [2022-04-27 13:13:33,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 13:13:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4028 transitions. [2022-04-27 13:13:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-27 13:13:33,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:33,603 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:13:33,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 13:13:33,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:33,803 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash 493698625, now seen corresponding path program 1 times [2022-04-27 13:13:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:33,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076883337] [2022-04-27 13:13:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:33,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105382413] [2022-04-27 13:13:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:33,818 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:13:33,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 13:13:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:33,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:13:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:33,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:34,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {125168#true} call ULTIMATE.init(); {125168#true} is VALID [2022-04-27 13:13:34,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {125168#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; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {125176#(<= ~counter~0 0)} assume true; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125176#(<= ~counter~0 0)} {125168#true} #108#return; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {125176#(<= ~counter~0 0)} call #t~ret9 := main(); {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {125176#(<= ~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;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; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {125176#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {125176#(<= ~counter~0 0)} ~cond := #in~cond; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {125176#(<= ~counter~0 0)} assume !(0 == ~cond); {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {125176#(<= ~counter~0 0)} assume true; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {125176#(<= ~counter~0 0)} {125176#(<= ~counter~0 0)} #94#return; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {125176#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {125176#(<= ~counter~0 0)} ~cond := #in~cond; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {125176#(<= ~counter~0 0)} assume !(0 == ~cond); {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {125176#(<= ~counter~0 0)} assume true; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {125176#(<= ~counter~0 0)} {125176#(<= ~counter~0 0)} #96#return; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {125176#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {125176#(<= ~counter~0 0)} is VALID [2022-04-27 13:13:34,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {125176#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125225#(<= ~counter~0 1)} is VALID [2022-04-27 13:13:34,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {125225#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {125225#(<= ~counter~0 1)} is VALID [2022-04-27 13:13:34,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {125225#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {125225#(<= ~counter~0 1)} is VALID [2022-04-27 13:13:34,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {125225#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125235#(<= ~counter~0 2)} is VALID [2022-04-27 13:13:34,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {125235#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {125235#(<= ~counter~0 2)} is VALID [2022-04-27 13:13:34,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {125235#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {125235#(<= ~counter~0 2)} is VALID [2022-04-27 13:13:34,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {125235#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {125245#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,414 INFO L272 TraceCheckUtils]: 25: Hoare triple {125245#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {125245#(<= ~counter~0 3)} ~cond := #in~cond; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {125245#(<= ~counter~0 3)} assume !(0 == ~cond); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {125245#(<= ~counter~0 3)} assume true; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,415 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {125245#(<= ~counter~0 3)} {125245#(<= ~counter~0 3)} #98#return; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,416 INFO L272 TraceCheckUtils]: 30: Hoare triple {125245#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {125245#(<= ~counter~0 3)} ~cond := #in~cond; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {125245#(<= ~counter~0 3)} assume !(0 == ~cond); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {125245#(<= ~counter~0 3)} assume true; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,417 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {125245#(<= ~counter~0 3)} {125245#(<= ~counter~0 3)} #100#return; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,417 INFO L272 TraceCheckUtils]: 35: Hoare triple {125245#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {125245#(<= ~counter~0 3)} ~cond := #in~cond; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {125245#(<= ~counter~0 3)} assume !(0 == ~cond); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {125245#(<= ~counter~0 3)} assume true; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,419 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {125245#(<= ~counter~0 3)} {125245#(<= ~counter~0 3)} #102#return; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,419 INFO L272 TraceCheckUtils]: 40: Hoare triple {125245#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {125245#(<= ~counter~0 3)} ~cond := #in~cond; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {125245#(<= ~counter~0 3)} assume !(0 == ~cond); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {125245#(<= ~counter~0 3)} assume true; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,420 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {125245#(<= ~counter~0 3)} {125245#(<= ~counter~0 3)} #104#return; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {125245#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {125245#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {125245#(<= ~counter~0 3)} is VALID [2022-04-27 13:13:34,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {125245#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125318#(<= ~counter~0 4)} is VALID [2022-04-27 13:13:34,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {125318#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {125318#(<= ~counter~0 4)} is VALID [2022-04-27 13:13:34,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {125318#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {125318#(<= ~counter~0 4)} is VALID [2022-04-27 13:13:34,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {125318#(<= ~counter~0 4)} ~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; {125318#(<= ~counter~0 4)} is VALID [2022-04-27 13:13:34,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {125318#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125331#(<= ~counter~0 5)} is VALID [2022-04-27 13:13:34,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {125331#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {125331#(<= ~counter~0 5)} is VALID [2022-04-27 13:13:34,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {125331#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {125331#(<= ~counter~0 5)} is VALID [2022-04-27 13:13:34,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {125331#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125341#(<= ~counter~0 6)} is VALID [2022-04-27 13:13:34,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {125341#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {125341#(<= ~counter~0 6)} is VALID [2022-04-27 13:13:34,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {125341#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {125341#(<= ~counter~0 6)} is VALID [2022-04-27 13:13:34,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {125341#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {125351#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,426 INFO L272 TraceCheckUtils]: 59: Hoare triple {125351#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {125351#(<= ~counter~0 7)} ~cond := #in~cond; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {125351#(<= ~counter~0 7)} assume !(0 == ~cond); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {125351#(<= ~counter~0 7)} assume true; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,428 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {125351#(<= ~counter~0 7)} {125351#(<= ~counter~0 7)} #98#return; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,428 INFO L272 TraceCheckUtils]: 64: Hoare triple {125351#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {125351#(<= ~counter~0 7)} ~cond := #in~cond; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {125351#(<= ~counter~0 7)} assume !(0 == ~cond); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {125351#(<= ~counter~0 7)} assume true; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,429 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {125351#(<= ~counter~0 7)} {125351#(<= ~counter~0 7)} #100#return; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,430 INFO L272 TraceCheckUtils]: 69: Hoare triple {125351#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {125351#(<= ~counter~0 7)} ~cond := #in~cond; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {125351#(<= ~counter~0 7)} assume !(0 == ~cond); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {125351#(<= ~counter~0 7)} assume true; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,431 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {125351#(<= ~counter~0 7)} {125351#(<= ~counter~0 7)} #102#return; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,432 INFO L272 TraceCheckUtils]: 74: Hoare triple {125351#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {125351#(<= ~counter~0 7)} ~cond := #in~cond; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {125351#(<= ~counter~0 7)} assume !(0 == ~cond); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {125351#(<= ~counter~0 7)} assume true; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,433 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {125351#(<= ~counter~0 7)} {125351#(<= ~counter~0 7)} #104#return; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,433 INFO L290 TraceCheckUtils]: 79: Hoare triple {125351#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {125351#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {125351#(<= ~counter~0 7)} is VALID [2022-04-27 13:13:34,434 INFO L290 TraceCheckUtils]: 81: Hoare triple {125351#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125424#(<= ~counter~0 8)} is VALID [2022-04-27 13:13:34,434 INFO L290 TraceCheckUtils]: 82: Hoare triple {125424#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {125424#(<= ~counter~0 8)} is VALID [2022-04-27 13:13:34,435 INFO L290 TraceCheckUtils]: 83: Hoare triple {125424#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {125424#(<= ~counter~0 8)} is VALID [2022-04-27 13:13:34,435 INFO L290 TraceCheckUtils]: 84: Hoare triple {125424#(<= ~counter~0 8)} ~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; {125424#(<= ~counter~0 8)} is VALID [2022-04-27 13:13:34,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {125424#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125437#(<= ~counter~0 9)} is VALID [2022-04-27 13:13:34,436 INFO L290 TraceCheckUtils]: 86: Hoare triple {125437#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {125437#(<= ~counter~0 9)} is VALID [2022-04-27 13:13:34,436 INFO L290 TraceCheckUtils]: 87: Hoare triple {125437#(<= ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {125437#(<= ~counter~0 9)} is VALID [2022-04-27 13:13:34,436 INFO L290 TraceCheckUtils]: 88: Hoare triple {125437#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125447#(<= |main_#t~post7| 9)} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 89: Hoare triple {125447#(<= |main_#t~post7| 9)} assume !(#t~post7 < 20);havoc #t~post7; {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 90: Hoare triple {125169#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; {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 91: Hoare triple {125169#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 92: Hoare triple {125169#false} assume !!(#t~post6 < 20);havoc #t~post6; {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 93: Hoare triple {125169#false} assume !(0 != ~b~0); {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L272 TraceCheckUtils]: 94: Hoare triple {125169#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 95: Hoare triple {125169#false} ~cond := #in~cond; {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 96: Hoare triple {125169#false} assume 0 == ~cond; {125169#false} is VALID [2022-04-27 13:13:34,437 INFO L290 TraceCheckUtils]: 97: Hoare triple {125169#false} assume !false; {125169#false} is VALID [2022-04-27 13:13:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:13:34,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 97: Hoare triple {125169#false} assume !false; {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {125169#false} assume 0 == ~cond; {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 95: Hoare triple {125169#false} ~cond := #in~cond; {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L272 TraceCheckUtils]: 94: Hoare triple {125169#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {125169#false} assume !(0 != ~b~0); {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {125169#false} assume !!(#t~post6 < 20);havoc #t~post6; {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 91: Hoare triple {125169#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125169#false} is VALID [2022-04-27 13:13:35,005 INFO L290 TraceCheckUtils]: 90: Hoare triple {125169#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; {125169#false} is VALID [2022-04-27 13:13:35,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {125499#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {125169#false} is VALID [2022-04-27 13:13:35,006 INFO L290 TraceCheckUtils]: 88: Hoare triple {125503#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125499#(< |main_#t~post7| 20)} is VALID [2022-04-27 13:13:35,006 INFO L290 TraceCheckUtils]: 87: Hoare triple {125503#(< ~counter~0 20)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {125503#(< ~counter~0 20)} is VALID [2022-04-27 13:13:35,007 INFO L290 TraceCheckUtils]: 86: Hoare triple {125503#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {125503#(< ~counter~0 20)} is VALID [2022-04-27 13:13:35,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {125513#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125503#(< ~counter~0 20)} is VALID [2022-04-27 13:13:35,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {125513#(< ~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; {125513#(< ~counter~0 19)} is VALID [2022-04-27 13:13:35,009 INFO L290 TraceCheckUtils]: 83: Hoare triple {125513#(< ~counter~0 19)} assume !(~c~0 >= ~b~0); {125513#(< ~counter~0 19)} is VALID [2022-04-27 13:13:35,009 INFO L290 TraceCheckUtils]: 82: Hoare triple {125513#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {125513#(< ~counter~0 19)} is VALID [2022-04-27 13:13:35,010 INFO L290 TraceCheckUtils]: 81: Hoare triple {125526#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125513#(< ~counter~0 19)} is VALID [2022-04-27 13:13:35,010 INFO L290 TraceCheckUtils]: 80: Hoare triple {125526#(< ~counter~0 18)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,010 INFO L290 TraceCheckUtils]: 79: Hoare triple {125526#(< ~counter~0 18)} assume !(~c~0 >= 2 * ~v~0); {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,011 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {125168#true} {125526#(< ~counter~0 18)} #104#return; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,011 INFO L272 TraceCheckUtils]: 74: Hoare triple {125526#(< ~counter~0 18)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,011 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {125168#true} {125526#(< ~counter~0 18)} #102#return; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L272 TraceCheckUtils]: 69: Hoare triple {125526#(< ~counter~0 18)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {125168#true} {125526#(< ~counter~0 18)} #100#return; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,012 INFO L290 TraceCheckUtils]: 67: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L290 TraceCheckUtils]: 66: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,012 INFO L272 TraceCheckUtils]: 64: Hoare triple {125526#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,013 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {125168#true} {125526#(< ~counter~0 18)} #98#return; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,013 INFO L290 TraceCheckUtils]: 62: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,013 INFO L272 TraceCheckUtils]: 59: Hoare triple {125526#(< ~counter~0 18)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {125526#(< ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {125599#(< ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {125526#(< ~counter~0 18)} is VALID [2022-04-27 13:13:35,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {125599#(< ~counter~0 17)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {125599#(< ~counter~0 17)} is VALID [2022-04-27 13:13:35,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {125599#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {125599#(< ~counter~0 17)} is VALID [2022-04-27 13:13:35,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {125609#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125599#(< ~counter~0 17)} is VALID [2022-04-27 13:13:35,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {125609#(< ~counter~0 16)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {125609#(< ~counter~0 16)} is VALID [2022-04-27 13:13:35,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {125609#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {125609#(< ~counter~0 16)} is VALID [2022-04-27 13:13:35,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {125619#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125609#(< ~counter~0 16)} is VALID [2022-04-27 13:13:35,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {125619#(< ~counter~0 15)} ~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; {125619#(< ~counter~0 15)} is VALID [2022-04-27 13:13:35,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {125619#(< ~counter~0 15)} assume !(~c~0 >= ~b~0); {125619#(< ~counter~0 15)} is VALID [2022-04-27 13:13:35,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {125619#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {125619#(< ~counter~0 15)} is VALID [2022-04-27 13:13:35,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {125632#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125619#(< ~counter~0 15)} is VALID [2022-04-27 13:13:35,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {125632#(< ~counter~0 14)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {125632#(< ~counter~0 14)} assume !(~c~0 >= 2 * ~v~0); {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,019 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {125168#true} {125632#(< ~counter~0 14)} #104#return; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,020 INFO L272 TraceCheckUtils]: 40: Hoare triple {125632#(< ~counter~0 14)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,020 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {125168#true} {125632#(< ~counter~0 14)} #102#return; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,020 INFO L272 TraceCheckUtils]: 35: Hoare triple {125632#(< ~counter~0 14)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,021 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {125168#true} {125632#(< ~counter~0 14)} #100#return; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,021 INFO L272 TraceCheckUtils]: 30: Hoare triple {125632#(< ~counter~0 14)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,022 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {125168#true} {125632#(< ~counter~0 14)} #98#return; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,022 INFO L272 TraceCheckUtils]: 25: Hoare triple {125632#(< ~counter~0 14)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {125632#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {125705#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {125632#(< ~counter~0 14)} is VALID [2022-04-27 13:13:35,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {125705#(< ~counter~0 13)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {125705#(< ~counter~0 13)} is VALID [2022-04-27 13:13:35,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {125705#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {125705#(< ~counter~0 13)} is VALID [2022-04-27 13:13:35,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {125715#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {125705#(< ~counter~0 13)} is VALID [2022-04-27 13:13:35,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {125715#(< ~counter~0 12)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {125715#(< ~counter~0 12)} is VALID [2022-04-27 13:13:35,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {125715#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {125715#(< ~counter~0 12)} is VALID [2022-04-27 13:13:35,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {125725#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {125715#(< ~counter~0 12)} is VALID [2022-04-27 13:13:35,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {125725#(< ~counter~0 11)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {125168#true} {125725#(< ~counter~0 11)} #96#return; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {125725#(< ~counter~0 11)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {125168#true} {125725#(< ~counter~0 11)} #94#return; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {125168#true} assume true; {125168#true} is VALID [2022-04-27 13:13:35,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {125168#true} assume !(0 == ~cond); {125168#true} is VALID [2022-04-27 13:13:35,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {125168#true} ~cond := #in~cond; {125168#true} is VALID [2022-04-27 13:13:35,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {125725#(< ~counter~0 11)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {125168#true} is VALID [2022-04-27 13:13:35,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {125725#(< ~counter~0 11)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {125725#(< ~counter~0 11)} call #t~ret9 := main(); {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125725#(< ~counter~0 11)} {125168#true} #108#return; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {125725#(< ~counter~0 11)} assume true; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {125168#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; {125725#(< ~counter~0 11)} is VALID [2022-04-27 13:13:35,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {125168#true} call ULTIMATE.init(); {125168#true} is VALID [2022-04-27 13:13:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 13:13:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:35,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076883337] [2022-04-27 13:13:35,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:35,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105382413] [2022-04-27 13:13:35,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105382413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:13:35,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:13:35,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-27 13:13:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038339760] [2022-04-27 13:13:35,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:13:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-04-27 13:13:35,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:35,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:13:35,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:13:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:13:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:13:35,154 INFO L87 Difference]: Start difference. First operand 2949 states and 4028 transitions. Second operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:13:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:51,843 INFO L93 Difference]: Finished difference Result 6529 states and 9288 transitions. [2022-04-27 13:13:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 13:13:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-04-27 13:13:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:13:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 562 transitions. [2022-04-27 13:13:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:13:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 562 transitions. [2022-04-27 13:13:51,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 562 transitions. [2022-04-27 13:13:52,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:53,637 INFO L225 Difference]: With dead ends: 6529 [2022-04-27 13:13:53,637 INFO L226 Difference]: Without dead ends: 5495 [2022-04-27 13:13:53,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=585, Invalid=1055, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 13:13:53,641 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 561 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:53,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 759 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:13:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2022-04-27 13:14:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5193. [2022-04-27 13:14:05,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:14:05,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5495 states. Second operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) [2022-04-27 13:14:05,831 INFO L74 IsIncluded]: Start isIncluded. First operand 5495 states. Second operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) [2022-04-27 13:14:05,834 INFO L87 Difference]: Start difference. First operand 5495 states. Second operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) [2022-04-27 13:14:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:14:06,665 INFO L93 Difference]: Finished difference Result 5495 states and 7503 transitions. [2022-04-27 13:14:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 7503 transitions. [2022-04-27 13:14:06,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:14:06,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:14:06,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) Second operand 5495 states. [2022-04-27 13:14:06,680 INFO L87 Difference]: Start difference. First operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) Second operand 5495 states. [2022-04-27 13:14:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:14:07,522 INFO L93 Difference]: Finished difference Result 5495 states and 7503 transitions. [2022-04-27 13:14:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 7503 transitions. [2022-04-27 13:14:07,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:14:07,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:14:07,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:14:07,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:14:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) [2022-04-27 13:14:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7184 transitions. [2022-04-27 13:14:08,647 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7184 transitions. Word has length 98 [2022-04-27 13:14:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:14:08,647 INFO L495 AbstractCegarLoop]: Abstraction has 5193 states and 7184 transitions. [2022-04-27 13:14:08,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:14:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7184 transitions. [2022-04-27 13:14:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-27 13:14:08,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:14:08,648 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:14:08,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 13:14:08,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:14:08,849 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:14:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:14:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash 911562927, now seen corresponding path program 2 times [2022-04-27 13:14:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:14:08,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12153407] [2022-04-27 13:14:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:14:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:14:08,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:14:08,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983821020] [2022-04-27 13:14:08,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:14:08,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:14:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:14:08,869 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:14:08,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 13:14:08,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:14:08,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:14:08,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-27 13:14:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:14:08,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:14:10,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {153890#true} call ULTIMATE.init(); {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {153890#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; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153890#true} {153890#true} #108#return; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {153890#true} call #t~ret9 := main(); {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {153890#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;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; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {153890#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {153890#true} {153890#true} #94#return; {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {153890#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:10,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,383 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {153890#true} {153890#true} #96#return; {153890#true} is VALID [2022-04-27 13:14:10,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {153890#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {153943#(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:14:10,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {153943#(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; {153943#(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:14:10,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {153943#(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; {153943#(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:14:10,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {153943#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {153953#(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:14:10,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {153953#(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; {153953#(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:14:10,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {153953#(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; {153953#(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:14:10,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {153953#(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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,389 INFO L272 TraceCheckUtils]: 25: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,390 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {153890#true} {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,390 INFO L272 TraceCheckUtils]: 30: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,391 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {153890#true} {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #100#return; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,391 INFO L272 TraceCheckUtils]: 35: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,392 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {153890#true} {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,392 INFO L272 TraceCheckUtils]: 40: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:10,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,393 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {153890#true} {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #104#return; {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {153963#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,394 INFO L272 TraceCheckUtils]: 48: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,395 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {153890#true} {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,395 INFO L272 TraceCheckUtils]: 53: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,396 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {153890#true} {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #100#return; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,396 INFO L272 TraceCheckUtils]: 58: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,397 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {153890#true} {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,397 INFO L272 TraceCheckUtils]: 63: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:10,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,398 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {153890#true} {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #104#return; {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {154033#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {154106#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {154106#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {154106#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {154106#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {154106#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {154106#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,402 INFO L272 TraceCheckUtils]: 75: Hoare triple {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {153890#true} ~cond := #in~cond; {154129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:10,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {154129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:10,403 INFO L290 TraceCheckUtils]: 78: Hoare triple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:10,403 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,404 INFO L272 TraceCheckUtils]: 80: Hoare triple {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,404 INFO L290 TraceCheckUtils]: 81: Hoare triple {153890#true} ~cond := #in~cond; {154129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:10,404 INFO L290 TraceCheckUtils]: 82: Hoare triple {154129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:10,404 INFO L290 TraceCheckUtils]: 83: Hoare triple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:10,405 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #100#return; {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,405 INFO L272 TraceCheckUtils]: 85: Hoare triple {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= 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)); {153890#true} is VALID [2022-04-27 13:14:10,405 INFO L290 TraceCheckUtils]: 86: Hoare triple {153890#true} ~cond := #in~cond; {154129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:10,406 INFO L290 TraceCheckUtils]: 87: Hoare triple {154129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:10,406 INFO L290 TraceCheckUtils]: 88: Hoare triple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:10,407 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} {154116#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,407 INFO L272 TraceCheckUtils]: 90: Hoare triple {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:10,407 INFO L290 TraceCheckUtils]: 91: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:10,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:10,407 INFO L290 TraceCheckUtils]: 93: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:10,408 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {153890#true} {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} #104#return; {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,409 INFO L290 TraceCheckUtils]: 95: Hoare triple {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {154170#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,411 INFO L290 TraceCheckUtils]: 98: Hoare triple {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,411 INFO L290 TraceCheckUtils]: 99: Hoare triple {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:14:10,412 INFO L290 TraceCheckUtils]: 100: Hoare triple {154192#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= 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; {154205#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-27 13:14:10,412 INFO L290 TraceCheckUtils]: 101: Hoare triple {154205#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {154205#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-27 13:14:10,413 INFO L290 TraceCheckUtils]: 102: Hoare triple {154205#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {154205#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-27 13:14:10,413 INFO L290 TraceCheckUtils]: 103: Hoare triple {154205#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} assume !(0 != ~b~0); {154215#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= (+ (* main_~a~0 (- 3)) main_~x~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-27 13:14:10,414 INFO L272 TraceCheckUtils]: 104: Hoare triple {154215#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= (+ (* main_~a~0 (- 3)) main_~x~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 (* main_~r~0 3)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {154219#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:14:10,414 INFO L290 TraceCheckUtils]: 105: Hoare triple {154219#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {154223#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:10,414 INFO L290 TraceCheckUtils]: 106: Hoare triple {154223#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {153891#false} is VALID [2022-04-27 13:14:10,414 INFO L290 TraceCheckUtils]: 107: Hoare triple {153891#false} assume !false; {153891#false} is VALID [2022-04-27 13:14:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 93 proven. 46 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-27 13:14:10,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:14:51,741 INFO L290 TraceCheckUtils]: 107: Hoare triple {153891#false} assume !false; {153891#false} is VALID [2022-04-27 13:14:51,741 INFO L290 TraceCheckUtils]: 106: Hoare triple {154223#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {153891#false} is VALID [2022-04-27 13:14:51,741 INFO L290 TraceCheckUtils]: 105: Hoare triple {154219#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {154223#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:51,742 INFO L272 TraceCheckUtils]: 104: Hoare triple {154239#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {154219#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:14:51,743 INFO L290 TraceCheckUtils]: 103: Hoare triple {154243#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {154239#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:14:51,743 INFO L290 TraceCheckUtils]: 102: Hoare triple {154243#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {154243#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:14:51,743 INFO L290 TraceCheckUtils]: 101: Hoare triple {154243#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {154243#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:14:52,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {154243#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:14:52,066 INFO L290 TraceCheckUtils]: 99: Hoare triple {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,086 INFO L290 TraceCheckUtils]: 96: Hoare triple {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {154253#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,086 INFO L290 TraceCheckUtils]: 95: Hoare triple {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,087 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {153890#true} {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,087 INFO L290 TraceCheckUtils]: 91: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,087 INFO L272 TraceCheckUtils]: 90: Hoare triple {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,089 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} {154288#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {154266#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:52,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {154298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:52,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {153890#true} ~cond := #in~cond; {154298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:14:52,090 INFO L272 TraceCheckUtils]: 85: Hoare triple {154288#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {153890#true} is VALID [2022-04-27 13:14:52,090 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} {154305#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {154288#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,091 INFO L290 TraceCheckUtils]: 83: Hoare triple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:52,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {154298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:52,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {153890#true} ~cond := #in~cond; {154298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:14:52,092 INFO L272 TraceCheckUtils]: 80: Hoare triple {154305#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {153890#true} is VALID [2022-04-27 13:14:52,093 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {154305#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,093 INFO L290 TraceCheckUtils]: 78: Hoare triple {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:52,094 INFO L290 TraceCheckUtils]: 77: Hoare triple {154298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {154133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:52,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {153890#true} ~cond := #in~cond; {154298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:14:52,094 INFO L272 TraceCheckUtils]: 75: Hoare triple {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {153890#true} is VALID [2022-04-27 13:14:52,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 20);havoc #t~post8; {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,095 INFO L290 TraceCheckUtils]: 73: Hoare triple {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,194 INFO L290 TraceCheckUtils]: 72: Hoare triple {153890#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {154321#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= 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)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:14:52,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {153890#true} assume !!(#t~post7 < 20);havoc #t~post7; {153890#true} is VALID [2022-04-27 13:14:52,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {153890#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {153890#true} is VALID [2022-04-27 13:14:52,194 INFO L290 TraceCheckUtils]: 69: Hoare triple {153890#true} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {153890#true} is VALID [2022-04-27 13:14:52,194 INFO L290 TraceCheckUtils]: 68: Hoare triple {153890#true} assume !(~c~0 >= 2 * ~v~0); {153890#true} is VALID [2022-04-27 13:14:52,194 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {153890#true} {153890#true} #104#return; {153890#true} is VALID [2022-04-27 13:14:52,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L272 TraceCheckUtils]: 63: Hoare triple {153890#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {153890#true} {153890#true} #102#return; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L272 TraceCheckUtils]: 58: Hoare triple {153890#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {153890#true} {153890#true} #100#return; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L272 TraceCheckUtils]: 53: Hoare triple {153890#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {153890#true} {153890#true} #98#return; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L272 TraceCheckUtils]: 48: Hoare triple {153890#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {153890#true} assume !!(#t~post8 < 20);havoc #t~post8; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {153890#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {153890#true} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {153890#true} {153890#true} #104#return; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L272 TraceCheckUtils]: 40: Hoare triple {153890#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {153890#true} {153890#true} #102#return; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L272 TraceCheckUtils]: 35: Hoare triple {153890#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {153890#true} {153890#true} #100#return; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L272 TraceCheckUtils]: 30: Hoare triple {153890#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {153890#true} {153890#true} #98#return; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L272 TraceCheckUtils]: 25: Hoare triple {153890#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {153890#true} assume !!(#t~post8 < 20);havoc #t~post8; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {153890#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {153890#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {153890#true} assume !!(#t~post7 < 20);havoc #t~post7; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {153890#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {153890#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {153890#true} assume !!(#t~post6 < 20);havoc #t~post6; {153890#true} is VALID [2022-04-27 13:14:52,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {153890#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {153890#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {153890#true} {153890#true} #96#return; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {153890#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {153890#true} {153890#true} #94#return; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {153890#true} assume !(0 == ~cond); {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {153890#true} ~cond := #in~cond; {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {153890#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {153890#true} is VALID [2022-04-27 13:14:52,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {153890#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;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; {153890#true} is VALID [2022-04-27 13:14:52,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {153890#true} call #t~ret9 := main(); {153890#true} is VALID [2022-04-27 13:14:52,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153890#true} {153890#true} #108#return; {153890#true} is VALID [2022-04-27 13:14:52,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {153890#true} assume true; {153890#true} is VALID [2022-04-27 13:14:52,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {153890#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; {153890#true} is VALID [2022-04-27 13:14:52,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {153890#true} call ULTIMATE.init(); {153890#true} is VALID [2022-04-27 13:14:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-04-27 13:14:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:14:52,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12153407] [2022-04-27 13:14:52,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:14:52,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983821020] [2022-04-27 13:14:52,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983821020] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:14:52,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:14:52,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-27 13:14:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531505830] [2022-04-27 13:14:52,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:14:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-04-27 13:14:52,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:14:52,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:14:53,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:14:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:14:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:14:53,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:14:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:14:53,064 INFO L87 Difference]: Start difference. First operand 5193 states and 7184 transitions. Second operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:15:01,752 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:15:15,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:15:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:28,923 INFO L93 Difference]: Finished difference Result 6197 states and 8558 transitions. [2022-04-27 13:15:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-27 13:15:28,924 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-04-27 13:15:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:15:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 307 transitions. [2022-04-27 13:15:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:15:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 307 transitions. [2022-04-27 13:15:28,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 307 transitions. [2022-04-27 13:15:31,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:32,978 INFO L225 Difference]: With dead ends: 6197 [2022-04-27 13:15:32,979 INFO L226 Difference]: Without dead ends: 6191 [2022-04-27 13:15:32,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 13:15:32,980 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 214 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 334 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:32,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 679 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1212 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2022-04-27 13:15:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2022-04-27 13:15:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5573. [2022-04-27 13:15:46,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:46,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6191 states. Second operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-04-27 13:15:46,880 INFO L74 IsIncluded]: Start isIncluded. First operand 6191 states. Second operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-04-27 13:15:46,883 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-04-27 13:15:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:48,055 INFO L93 Difference]: Finished difference Result 6191 states and 8508 transitions. [2022-04-27 13:15:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 8508 transitions. [2022-04-27 13:15:48,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:48,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:48,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) Second operand 6191 states. [2022-04-27 13:15:48,087 INFO L87 Difference]: Start difference. First operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) Second operand 6191 states. [2022-04-27 13:15:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,320 INFO L93 Difference]: Finished difference Result 6191 states and 8508 transitions. [2022-04-27 13:15:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 8508 transitions. [2022-04-27 13:15:49,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:49,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:49,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:49,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-04-27 13:15:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 7780 transitions. [2022-04-27 13:15:50,710 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 7780 transitions. Word has length 108 [2022-04-27 13:15:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:50,711 INFO L495 AbstractCegarLoop]: Abstraction has 5573 states and 7780 transitions. [2022-04-27 13:15:50,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:15:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 7780 transitions. [2022-04-27 13:15:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 13:15:50,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:50,712 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:50,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 13:15:50,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 13:15:50,912 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash -193506847, now seen corresponding path program 1 times [2022-04-27 13:15:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:50,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468207526] [2022-04-27 13:15:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:50,929 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:50,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687195710] [2022-04-27 13:15:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:50,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:50,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 13:15:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:15:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:51,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {184169#true} call ULTIMATE.init(); {184169#true} is VALID [2022-04-27 13:15:51,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {184169#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; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {184177#(<= ~counter~0 0)} assume true; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184177#(<= ~counter~0 0)} {184169#true} #108#return; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {184177#(<= ~counter~0 0)} call #t~ret9 := main(); {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {184177#(<= ~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;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; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {184177#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {184177#(<= ~counter~0 0)} ~cond := #in~cond; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {184177#(<= ~counter~0 0)} assume !(0 == ~cond); {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {184177#(<= ~counter~0 0)} assume true; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {184177#(<= ~counter~0 0)} {184177#(<= ~counter~0 0)} #94#return; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,561 INFO L272 TraceCheckUtils]: 11: Hoare triple {184177#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {184177#(<= ~counter~0 0)} ~cond := #in~cond; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {184177#(<= ~counter~0 0)} assume !(0 == ~cond); {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {184177#(<= ~counter~0 0)} assume true; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184177#(<= ~counter~0 0)} {184177#(<= ~counter~0 0)} #96#return; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {184177#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {184177#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {184177#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184226#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:51,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {184226#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {184226#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:51,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {184226#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {184226#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:51,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {184226#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184236#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:51,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {184236#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {184236#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:51,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {184236#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {184236#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:51,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {184236#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {184246#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,568 INFO L272 TraceCheckUtils]: 25: Hoare triple {184246#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {184246#(<= ~counter~0 3)} ~cond := #in~cond; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {184246#(<= ~counter~0 3)} assume !(0 == ~cond); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {184246#(<= ~counter~0 3)} assume true; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,569 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {184246#(<= ~counter~0 3)} {184246#(<= ~counter~0 3)} #98#return; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,569 INFO L272 TraceCheckUtils]: 30: Hoare triple {184246#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {184246#(<= ~counter~0 3)} ~cond := #in~cond; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {184246#(<= ~counter~0 3)} assume !(0 == ~cond); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {184246#(<= ~counter~0 3)} assume true; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,571 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {184246#(<= ~counter~0 3)} {184246#(<= ~counter~0 3)} #100#return; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,571 INFO L272 TraceCheckUtils]: 35: Hoare triple {184246#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {184246#(<= ~counter~0 3)} ~cond := #in~cond; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {184246#(<= ~counter~0 3)} assume !(0 == ~cond); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {184246#(<= ~counter~0 3)} assume true; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,573 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {184246#(<= ~counter~0 3)} {184246#(<= ~counter~0 3)} #102#return; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,573 INFO L272 TraceCheckUtils]: 40: Hoare triple {184246#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {184246#(<= ~counter~0 3)} ~cond := #in~cond; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {184246#(<= ~counter~0 3)} assume !(0 == ~cond); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {184246#(<= ~counter~0 3)} assume true; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,574 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {184246#(<= ~counter~0 3)} {184246#(<= ~counter~0 3)} #104#return; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {184246#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {184246#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {184246#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:51,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {184246#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184319#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:51,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {184319#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {184319#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:51,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {184319#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {184319#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:51,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {184319#(<= ~counter~0 4)} ~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; {184319#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:51,577 INFO L290 TraceCheckUtils]: 51: Hoare triple {184319#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184332#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:51,578 INFO L290 TraceCheckUtils]: 52: Hoare triple {184332#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {184332#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:51,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {184332#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {184332#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:51,579 INFO L290 TraceCheckUtils]: 54: Hoare triple {184332#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184342#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:51,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {184342#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {184342#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:51,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {184342#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {184342#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:51,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {184342#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {184352#(<= ~counter~0 7)} assume !!(#t~post8 < 20);havoc #t~post8; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,581 INFO L272 TraceCheckUtils]: 59: Hoare triple {184352#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {184352#(<= ~counter~0 7)} ~cond := #in~cond; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {184352#(<= ~counter~0 7)} assume !(0 == ~cond); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {184352#(<= ~counter~0 7)} assume true; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,582 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {184352#(<= ~counter~0 7)} {184352#(<= ~counter~0 7)} #98#return; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,583 INFO L272 TraceCheckUtils]: 64: Hoare triple {184352#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {184352#(<= ~counter~0 7)} ~cond := #in~cond; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {184352#(<= ~counter~0 7)} assume !(0 == ~cond); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {184352#(<= ~counter~0 7)} assume true; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,584 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {184352#(<= ~counter~0 7)} {184352#(<= ~counter~0 7)} #100#return; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,585 INFO L272 TraceCheckUtils]: 69: Hoare triple {184352#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {184352#(<= ~counter~0 7)} ~cond := #in~cond; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {184352#(<= ~counter~0 7)} assume !(0 == ~cond); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {184352#(<= ~counter~0 7)} assume true; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,586 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {184352#(<= ~counter~0 7)} {184352#(<= ~counter~0 7)} #102#return; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,587 INFO L272 TraceCheckUtils]: 74: Hoare triple {184352#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {184352#(<= ~counter~0 7)} ~cond := #in~cond; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {184352#(<= ~counter~0 7)} assume !(0 == ~cond); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {184352#(<= ~counter~0 7)} assume true; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,588 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {184352#(<= ~counter~0 7)} {184352#(<= ~counter~0 7)} #104#return; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,589 INFO L290 TraceCheckUtils]: 79: Hoare triple {184352#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {184352#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {184352#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:51,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {184352#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184425#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:51,590 INFO L290 TraceCheckUtils]: 82: Hoare triple {184425#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {184425#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:51,590 INFO L290 TraceCheckUtils]: 83: Hoare triple {184425#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {184425#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:51,590 INFO L290 TraceCheckUtils]: 84: Hoare triple {184425#(<= ~counter~0 8)} ~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; {184425#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:51,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {184425#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:51,592 INFO L290 TraceCheckUtils]: 86: Hoare triple {184438#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:51,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {184438#(<= ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:51,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {184438#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184448#(<= ~counter~0 10)} is VALID [2022-04-27 13:15:51,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {184448#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {184448#(<= ~counter~0 10)} is VALID [2022-04-27 13:15:51,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {184448#(<= ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {184448#(<= ~counter~0 10)} is VALID [2022-04-27 13:15:51,593 INFO L290 TraceCheckUtils]: 91: Hoare triple {184448#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184458#(<= |main_#t~post8| 10)} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {184458#(<= |main_#t~post8| 10)} assume !(#t~post8 < 20);havoc #t~post8; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {184170#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 94: Hoare triple {184170#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 95: Hoare triple {184170#false} assume !!(#t~post7 < 20);havoc #t~post7; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 96: Hoare triple {184170#false} assume !(~c~0 >= ~b~0); {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 97: Hoare triple {184170#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; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 98: Hoare triple {184170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 99: Hoare triple {184170#false} assume !!(#t~post6 < 20);havoc #t~post6; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 100: Hoare triple {184170#false} assume !(0 != ~b~0); {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L272 TraceCheckUtils]: 101: Hoare triple {184170#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 102: Hoare triple {184170#false} ~cond := #in~cond; {184170#false} is VALID [2022-04-27 13:15:51,594 INFO L290 TraceCheckUtils]: 103: Hoare triple {184170#false} assume 0 == ~cond; {184170#false} is VALID [2022-04-27 13:15:51,595 INFO L290 TraceCheckUtils]: 104: Hoare triple {184170#false} assume !false; {184170#false} is VALID [2022-04-27 13:15:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 116 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:15:51,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {184170#false} assume !false; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 103: Hoare triple {184170#false} assume 0 == ~cond; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 102: Hoare triple {184170#false} ~cond := #in~cond; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L272 TraceCheckUtils]: 101: Hoare triple {184170#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 100: Hoare triple {184170#false} assume !(0 != ~b~0); {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 99: Hoare triple {184170#false} assume !!(#t~post6 < 20);havoc #t~post6; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {184170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {184170#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; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {184170#false} assume !(~c~0 >= ~b~0); {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {184170#false} assume !!(#t~post7 < 20);havoc #t~post7; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 94: Hoare triple {184170#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184170#false} is VALID [2022-04-27 13:15:52,161 INFO L290 TraceCheckUtils]: 93: Hoare triple {184170#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {184170#false} is VALID [2022-04-27 13:15:52,162 INFO L290 TraceCheckUtils]: 92: Hoare triple {184534#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {184170#false} is VALID [2022-04-27 13:15:52,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {184538#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184534#(< |main_#t~post8| 20)} is VALID [2022-04-27 13:15:52,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {184538#(< ~counter~0 20)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {184538#(< ~counter~0 20)} is VALID [2022-04-27 13:15:52,163 INFO L290 TraceCheckUtils]: 89: Hoare triple {184538#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {184538#(< ~counter~0 20)} is VALID [2022-04-27 13:15:52,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {184548#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184538#(< ~counter~0 20)} is VALID [2022-04-27 13:15:52,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {184548#(< ~counter~0 19)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {184548#(< ~counter~0 19)} is VALID [2022-04-27 13:15:52,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {184548#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {184548#(< ~counter~0 19)} is VALID [2022-04-27 13:15:52,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {184558#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184548#(< ~counter~0 19)} is VALID [2022-04-27 13:15:52,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {184558#(< ~counter~0 18)} ~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; {184558#(< ~counter~0 18)} is VALID [2022-04-27 13:15:52,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {184558#(< ~counter~0 18)} assume !(~c~0 >= ~b~0); {184558#(< ~counter~0 18)} is VALID [2022-04-27 13:15:52,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {184558#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {184558#(< ~counter~0 18)} is VALID [2022-04-27 13:15:52,167 INFO L290 TraceCheckUtils]: 81: Hoare triple {184571#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184558#(< ~counter~0 18)} is VALID [2022-04-27 13:15:52,167 INFO L290 TraceCheckUtils]: 80: Hoare triple {184571#(< ~counter~0 17)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {184571#(< ~counter~0 17)} assume !(~c~0 >= 2 * ~v~0); {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,168 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {184169#true} {184571#(< ~counter~0 17)} #104#return; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,168 INFO L272 TraceCheckUtils]: 74: Hoare triple {184571#(< ~counter~0 17)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,169 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {184169#true} {184571#(< ~counter~0 17)} #102#return; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,169 INFO L290 TraceCheckUtils]: 72: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,169 INFO L290 TraceCheckUtils]: 71: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,169 INFO L272 TraceCheckUtils]: 69: Hoare triple {184571#(< ~counter~0 17)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,170 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {184169#true} {184571#(< ~counter~0 17)} #100#return; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,170 INFO L272 TraceCheckUtils]: 64: Hoare triple {184571#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,171 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {184169#true} {184571#(< ~counter~0 17)} #98#return; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,171 INFO L272 TraceCheckUtils]: 59: Hoare triple {184571#(< ~counter~0 17)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {184571#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {184644#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184571#(< ~counter~0 17)} is VALID [2022-04-27 13:15:52,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {184644#(< ~counter~0 16)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {184644#(< ~counter~0 16)} is VALID [2022-04-27 13:15:52,172 INFO L290 TraceCheckUtils]: 55: Hoare triple {184644#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {184644#(< ~counter~0 16)} is VALID [2022-04-27 13:15:52,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {184654#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184644#(< ~counter~0 16)} is VALID [2022-04-27 13:15:52,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {184654#(< ~counter~0 15)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {184654#(< ~counter~0 15)} is VALID [2022-04-27 13:15:52,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {184654#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {184654#(< ~counter~0 15)} is VALID [2022-04-27 13:15:52,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {184664#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184654#(< ~counter~0 15)} is VALID [2022-04-27 13:15:52,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {184664#(< ~counter~0 14)} ~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; {184664#(< ~counter~0 14)} is VALID [2022-04-27 13:15:52,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {184664#(< ~counter~0 14)} assume !(~c~0 >= ~b~0); {184664#(< ~counter~0 14)} is VALID [2022-04-27 13:15:52,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {184664#(< ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {184664#(< ~counter~0 14)} is VALID [2022-04-27 13:15:52,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {184677#(< ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184664#(< ~counter~0 14)} is VALID [2022-04-27 13:15:52,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {184677#(< ~counter~0 13)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {184677#(< ~counter~0 13)} assume !(~c~0 >= 2 * ~v~0); {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,177 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {184169#true} {184677#(< ~counter~0 13)} #104#return; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,177 INFO L272 TraceCheckUtils]: 40: Hoare triple {184677#(< ~counter~0 13)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,178 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {184169#true} {184677#(< ~counter~0 13)} #102#return; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,178 INFO L272 TraceCheckUtils]: 35: Hoare triple {184677#(< ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,179 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {184169#true} {184677#(< ~counter~0 13)} #100#return; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,179 INFO L272 TraceCheckUtils]: 30: Hoare triple {184677#(< ~counter~0 13)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,179 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {184169#true} {184677#(< ~counter~0 13)} #98#return; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,180 INFO L272 TraceCheckUtils]: 25: Hoare triple {184677#(< ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {184677#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {184750#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184677#(< ~counter~0 13)} is VALID [2022-04-27 13:15:52,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {184750#(< ~counter~0 12)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {184750#(< ~counter~0 12)} is VALID [2022-04-27 13:15:52,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {184750#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {184750#(< ~counter~0 12)} is VALID [2022-04-27 13:15:52,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {184448#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184750#(< ~counter~0 12)} is VALID [2022-04-27 13:15:52,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {184448#(<= ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {184448#(<= ~counter~0 10)} is VALID [2022-04-27 13:15:52,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {184448#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {184448#(<= ~counter~0 10)} is VALID [2022-04-27 13:15:52,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {184438#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184448#(<= ~counter~0 10)} is VALID [2022-04-27 13:15:52,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {184438#(<= ~counter~0 9)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,184 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184169#true} {184438#(<= ~counter~0 9)} #96#return; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,184 INFO L272 TraceCheckUtils]: 11: Hoare triple {184438#(<= ~counter~0 9)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {184169#true} {184438#(<= ~counter~0 9)} #94#return; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {184169#true} assume true; {184169#true} is VALID [2022-04-27 13:15:52,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {184169#true} assume !(0 == ~cond); {184169#true} is VALID [2022-04-27 13:15:52,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {184169#true} ~cond := #in~cond; {184169#true} is VALID [2022-04-27 13:15:52,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {184438#(<= ~counter~0 9)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {184169#true} is VALID [2022-04-27 13:15:52,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {184438#(<= ~counter~0 9)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {184438#(<= ~counter~0 9)} call #t~ret9 := main(); {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184438#(<= ~counter~0 9)} {184169#true} #108#return; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {184438#(<= ~counter~0 9)} assume true; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {184169#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; {184438#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:52,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {184169#true} call ULTIMATE.init(); {184169#true} is VALID [2022-04-27 13:15:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 13:15:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:52,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468207526] [2022-04-27 13:15:52,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:52,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687195710] [2022-04-27 13:15:52,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687195710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:52,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:52,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-27 13:15:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889776540] [2022-04-27 13:15:52,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:52,188 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-04-27 13:15:52,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:52,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:15:52,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:52,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:15:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:15:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:15:52,326 INFO L87 Difference]: Start difference. First operand 5573 states and 7780 transitions. Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:16:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:10,835 INFO L93 Difference]: Finished difference Result 8468 states and 11912 transitions. [2022-04-27 13:16:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 13:16:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-04-27 13:16:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:16:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 518 transitions. [2022-04-27 13:16:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:16:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 518 transitions. [2022-04-27 13:16:10,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 518 transitions. [2022-04-27 13:16:11,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:12,579 INFO L225 Difference]: With dead ends: 8468 [2022-04-27 13:16:12,579 INFO L226 Difference]: Without dead ends: 5314 [2022-04-27 13:16:12,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=585, Invalid=1055, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 13:16:12,585 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 577 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:12,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 534 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:16:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2022-04-27 13:16:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5265. [2022-04-27 13:16:25,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:25,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5314 states. Second operand has 5265 states, 3488 states have (on average 1.198394495412844) internal successors, (4180), 3504 states have internal predecessors, (4180), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:16:25,550 INFO L74 IsIncluded]: Start isIncluded. First operand 5314 states. Second operand has 5265 states, 3488 states have (on average 1.198394495412844) internal successors, (4180), 3504 states have internal predecessors, (4180), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:16:25,553 INFO L87 Difference]: Start difference. First operand 5314 states. Second operand has 5265 states, 3488 states have (on average 1.198394495412844) internal successors, (4180), 3504 states have internal predecessors, (4180), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:16:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:26,380 INFO L93 Difference]: Finished difference Result 5314 states and 7112 transitions. [2022-04-27 13:16:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 7112 transitions. [2022-04-27 13:16:26,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:26,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:26,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 5265 states, 3488 states have (on average 1.198394495412844) internal successors, (4180), 3504 states have internal predecessors, (4180), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) Second operand 5314 states. [2022-04-27 13:16:26,396 INFO L87 Difference]: Start difference. First operand has 5265 states, 3488 states have (on average 1.198394495412844) internal successors, (4180), 3504 states have internal predecessors, (4180), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) Second operand 5314 states. [2022-04-27 13:16:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,240 INFO L93 Difference]: Finished difference Result 5314 states and 7112 transitions. [2022-04-27 13:16:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 7112 transitions. [2022-04-27 13:16:27,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:27,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:27,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:27,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 3488 states have (on average 1.198394495412844) internal successors, (4180), 3504 states have internal predecessors, (4180), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:16:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 7068 transitions. [2022-04-27 13:16:28,491 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 7068 transitions. Word has length 105 [2022-04-27 13:16:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:28,491 INFO L495 AbstractCegarLoop]: Abstraction has 5265 states and 7068 transitions. [2022-04-27 13:16:28,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-27 13:16:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 7068 transitions. [2022-04-27 13:16:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 13:16:28,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:28,494 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 7, 7, 5, 4, 4, 4, 4, 3, 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] [2022-04-27 13:16:28,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:28,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 13:16:28,717 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 862891816, now seen corresponding path program 2 times [2022-04-27 13:16:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:28,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190591401] [2022-04-27 13:16:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:28,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:28,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307154827] [2022-04-27 13:16:28,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:16:28,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:28,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:28,738 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:28,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-27 13:16:28,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:16:28,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:28,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 13:16:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:28,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:29,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {215759#true} call ULTIMATE.init(); {215759#true} is VALID [2022-04-27 13:16:29,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {215759#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; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {215767#(<= ~counter~0 0)} assume true; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215767#(<= ~counter~0 0)} {215759#true} #108#return; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {215767#(<= ~counter~0 0)} call #t~ret9 := main(); {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {215767#(<= ~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;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; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {215767#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {215767#(<= ~counter~0 0)} ~cond := #in~cond; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {215767#(<= ~counter~0 0)} assume !(0 == ~cond); {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {215767#(<= ~counter~0 0)} assume true; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {215767#(<= ~counter~0 0)} {215767#(<= ~counter~0 0)} #94#return; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,527 INFO L272 TraceCheckUtils]: 11: Hoare triple {215767#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {215767#(<= ~counter~0 0)} ~cond := #in~cond; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {215767#(<= ~counter~0 0)} assume !(0 == ~cond); {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {215767#(<= ~counter~0 0)} assume true; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,528 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {215767#(<= ~counter~0 0)} {215767#(<= ~counter~0 0)} #96#return; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {215767#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {215767#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:29,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {215767#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215816#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:29,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {215816#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {215816#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:29,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {215816#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {215816#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:29,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {215816#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215826#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:29,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {215826#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {215826#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:29,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {215826#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {215826#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:29,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {215826#(<= ~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; {215826#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:29,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {215826#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215839#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:29,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {215839#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {215839#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:29,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {215839#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {215839#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:29,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {215839#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215849#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:29,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {215849#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {215849#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:29,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {215849#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {215849#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:29,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {215849#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {215859#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,537 INFO L272 TraceCheckUtils]: 32: Hoare triple {215859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {215859#(<= ~counter~0 5)} ~cond := #in~cond; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {215859#(<= ~counter~0 5)} assume !(0 == ~cond); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {215859#(<= ~counter~0 5)} assume true; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,538 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {215859#(<= ~counter~0 5)} {215859#(<= ~counter~0 5)} #98#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,539 INFO L272 TraceCheckUtils]: 37: Hoare triple {215859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {215859#(<= ~counter~0 5)} ~cond := #in~cond; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {215859#(<= ~counter~0 5)} assume !(0 == ~cond); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {215859#(<= ~counter~0 5)} assume true; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,540 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {215859#(<= ~counter~0 5)} {215859#(<= ~counter~0 5)} #100#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,540 INFO L272 TraceCheckUtils]: 42: Hoare triple {215859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {215859#(<= ~counter~0 5)} ~cond := #in~cond; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {215859#(<= ~counter~0 5)} assume !(0 == ~cond); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {215859#(<= ~counter~0 5)} assume true; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,542 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {215859#(<= ~counter~0 5)} {215859#(<= ~counter~0 5)} #102#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,542 INFO L272 TraceCheckUtils]: 47: Hoare triple {215859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {215859#(<= ~counter~0 5)} ~cond := #in~cond; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,543 INFO L290 TraceCheckUtils]: 49: Hoare triple {215859#(<= ~counter~0 5)} assume !(0 == ~cond); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {215859#(<= ~counter~0 5)} assume true; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,543 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {215859#(<= ~counter~0 5)} {215859#(<= ~counter~0 5)} #104#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {215859#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {215859#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:29,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {215859#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:29,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {215932#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:29,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {215932#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:29,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {215932#(<= ~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; {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:29,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {215932#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:29,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {215945#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:29,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {215945#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:29,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {215945#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215955#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:29,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {215955#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {215955#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:29,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {215955#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {215955#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:29,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {215955#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {215965#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,550 INFO L272 TraceCheckUtils]: 66: Hoare triple {215965#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {215965#(<= ~counter~0 9)} ~cond := #in~cond; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {215965#(<= ~counter~0 9)} assume !(0 == ~cond); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {215965#(<= ~counter~0 9)} assume true; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,551 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {215965#(<= ~counter~0 9)} {215965#(<= ~counter~0 9)} #98#return; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,552 INFO L272 TraceCheckUtils]: 71: Hoare triple {215965#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {215965#(<= ~counter~0 9)} ~cond := #in~cond; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {215965#(<= ~counter~0 9)} assume !(0 == ~cond); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {215965#(<= ~counter~0 9)} assume true; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,553 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {215965#(<= ~counter~0 9)} {215965#(<= ~counter~0 9)} #100#return; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,553 INFO L272 TraceCheckUtils]: 76: Hoare triple {215965#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {215965#(<= ~counter~0 9)} ~cond := #in~cond; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {215965#(<= ~counter~0 9)} assume !(0 == ~cond); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {215965#(<= ~counter~0 9)} assume true; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,555 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {215965#(<= ~counter~0 9)} {215965#(<= ~counter~0 9)} #102#return; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,555 INFO L272 TraceCheckUtils]: 81: Hoare triple {215965#(<= ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,556 INFO L290 TraceCheckUtils]: 82: Hoare triple {215965#(<= ~counter~0 9)} ~cond := #in~cond; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {215965#(<= ~counter~0 9)} assume !(0 == ~cond); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,556 INFO L290 TraceCheckUtils]: 84: Hoare triple {215965#(<= ~counter~0 9)} assume true; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,557 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {215965#(<= ~counter~0 9)} {215965#(<= ~counter~0 9)} #104#return; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {215965#(<= ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,557 INFO L290 TraceCheckUtils]: 87: Hoare triple {215965#(<= ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:29,559 INFO L290 TraceCheckUtils]: 88: Hoare triple {215965#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:29,559 INFO L290 TraceCheckUtils]: 89: Hoare triple {216038#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:29,560 INFO L290 TraceCheckUtils]: 90: Hoare triple {216038#(<= ~counter~0 10)} assume !(~c~0 >= ~b~0); {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:29,560 INFO L290 TraceCheckUtils]: 91: Hoare triple {216038#(<= ~counter~0 10)} ~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; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:29,561 INFO L290 TraceCheckUtils]: 92: Hoare triple {216038#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:29,561 INFO L290 TraceCheckUtils]: 93: Hoare triple {216051#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:29,562 INFO L290 TraceCheckUtils]: 94: Hoare triple {216051#(<= ~counter~0 11)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:29,562 INFO L290 TraceCheckUtils]: 95: Hoare triple {216051#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216061#(<= ~counter~0 12)} is VALID [2022-04-27 13:16:29,563 INFO L290 TraceCheckUtils]: 96: Hoare triple {216061#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {216061#(<= ~counter~0 12)} is VALID [2022-04-27 13:16:29,563 INFO L290 TraceCheckUtils]: 97: Hoare triple {216061#(<= ~counter~0 12)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {216061#(<= ~counter~0 12)} is VALID [2022-04-27 13:16:29,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {216061#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,564 INFO L290 TraceCheckUtils]: 99: Hoare triple {216071#(<= ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,564 INFO L272 TraceCheckUtils]: 100: Hoare triple {216071#(<= ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {216071#(<= ~counter~0 13)} ~cond := #in~cond; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,565 INFO L290 TraceCheckUtils]: 102: Hoare triple {216071#(<= ~counter~0 13)} assume !(0 == ~cond); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,565 INFO L290 TraceCheckUtils]: 103: Hoare triple {216071#(<= ~counter~0 13)} assume true; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,566 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {216071#(<= ~counter~0 13)} {216071#(<= ~counter~0 13)} #98#return; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,566 INFO L272 TraceCheckUtils]: 105: Hoare triple {216071#(<= ~counter~0 13)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,567 INFO L290 TraceCheckUtils]: 106: Hoare triple {216071#(<= ~counter~0 13)} ~cond := #in~cond; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,567 INFO L290 TraceCheckUtils]: 107: Hoare triple {216071#(<= ~counter~0 13)} assume !(0 == ~cond); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,567 INFO L290 TraceCheckUtils]: 108: Hoare triple {216071#(<= ~counter~0 13)} assume true; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,568 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {216071#(<= ~counter~0 13)} {216071#(<= ~counter~0 13)} #100#return; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,568 INFO L272 TraceCheckUtils]: 110: Hoare triple {216071#(<= ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,568 INFO L290 TraceCheckUtils]: 111: Hoare triple {216071#(<= ~counter~0 13)} ~cond := #in~cond; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,569 INFO L290 TraceCheckUtils]: 112: Hoare triple {216071#(<= ~counter~0 13)} assume !(0 == ~cond); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,569 INFO L290 TraceCheckUtils]: 113: Hoare triple {216071#(<= ~counter~0 13)} assume true; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,569 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {216071#(<= ~counter~0 13)} {216071#(<= ~counter~0 13)} #102#return; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,570 INFO L272 TraceCheckUtils]: 115: Hoare triple {216071#(<= ~counter~0 13)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,570 INFO L290 TraceCheckUtils]: 116: Hoare triple {216071#(<= ~counter~0 13)} ~cond := #in~cond; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,571 INFO L290 TraceCheckUtils]: 117: Hoare triple {216071#(<= ~counter~0 13)} assume !(0 == ~cond); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {216071#(<= ~counter~0 13)} assume true; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,571 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {216071#(<= ~counter~0 13)} {216071#(<= ~counter~0 13)} #104#return; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,572 INFO L290 TraceCheckUtils]: 120: Hoare triple {216071#(<= ~counter~0 13)} assume !(~c~0 >= 2 * ~v~0); {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,572 INFO L290 TraceCheckUtils]: 121: Hoare triple {216071#(<= ~counter~0 13)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:29,573 INFO L290 TraceCheckUtils]: 122: Hoare triple {216071#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:29,573 INFO L290 TraceCheckUtils]: 123: Hoare triple {216144#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:29,573 INFO L290 TraceCheckUtils]: 124: Hoare triple {216144#(<= ~counter~0 14)} assume !(~c~0 >= ~b~0); {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:29,574 INFO L290 TraceCheckUtils]: 125: Hoare triple {216144#(<= ~counter~0 14)} ~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; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:29,574 INFO L290 TraceCheckUtils]: 126: Hoare triple {216144#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {216157#(<= |main_#t~post6| 14)} is VALID [2022-04-27 13:16:29,574 INFO L290 TraceCheckUtils]: 127: Hoare triple {216157#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {215760#false} is VALID [2022-04-27 13:16:29,574 INFO L272 TraceCheckUtils]: 128: Hoare triple {215760#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {215760#false} is VALID [2022-04-27 13:16:29,574 INFO L290 TraceCheckUtils]: 129: Hoare triple {215760#false} ~cond := #in~cond; {215760#false} is VALID [2022-04-27 13:16:29,575 INFO L290 TraceCheckUtils]: 130: Hoare triple {215760#false} assume 0 == ~cond; {215760#false} is VALID [2022-04-27 13:16:29,575 INFO L290 TraceCheckUtils]: 131: Hoare triple {215760#false} assume !false; {215760#false} is VALID [2022-04-27 13:16:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 311 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-04-27 13:16:29,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:30,262 INFO L290 TraceCheckUtils]: 131: Hoare triple {215760#false} assume !false; {215760#false} is VALID [2022-04-27 13:16:30,262 INFO L290 TraceCheckUtils]: 130: Hoare triple {215760#false} assume 0 == ~cond; {215760#false} is VALID [2022-04-27 13:16:30,262 INFO L290 TraceCheckUtils]: 129: Hoare triple {215760#false} ~cond := #in~cond; {215760#false} is VALID [2022-04-27 13:16:30,262 INFO L272 TraceCheckUtils]: 128: Hoare triple {215760#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {215760#false} is VALID [2022-04-27 13:16:30,262 INFO L290 TraceCheckUtils]: 127: Hoare triple {216185#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {215760#false} is VALID [2022-04-27 13:16:30,263 INFO L290 TraceCheckUtils]: 126: Hoare triple {216189#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {216185#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:16:30,263 INFO L290 TraceCheckUtils]: 125: Hoare triple {216189#(< ~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; {216189#(< ~counter~0 20)} is VALID [2022-04-27 13:16:30,263 INFO L290 TraceCheckUtils]: 124: Hoare triple {216189#(< ~counter~0 20)} assume !(~c~0 >= ~b~0); {216189#(< ~counter~0 20)} is VALID [2022-04-27 13:16:30,263 INFO L290 TraceCheckUtils]: 123: Hoare triple {216189#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {216189#(< ~counter~0 20)} is VALID [2022-04-27 13:16:30,265 INFO L290 TraceCheckUtils]: 122: Hoare triple {216202#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216189#(< ~counter~0 20)} is VALID [2022-04-27 13:16:30,265 INFO L290 TraceCheckUtils]: 121: Hoare triple {216202#(< ~counter~0 19)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {216202#(< ~counter~0 19)} assume !(~c~0 >= 2 * ~v~0); {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,266 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {215759#true} {216202#(< ~counter~0 19)} #104#return; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,266 INFO L290 TraceCheckUtils]: 118: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,266 INFO L290 TraceCheckUtils]: 116: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,266 INFO L272 TraceCheckUtils]: 115: Hoare triple {216202#(< ~counter~0 19)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,267 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {215759#true} {216202#(< ~counter~0 19)} #102#return; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,267 INFO L290 TraceCheckUtils]: 113: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,267 INFO L290 TraceCheckUtils]: 112: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,267 INFO L290 TraceCheckUtils]: 111: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,267 INFO L272 TraceCheckUtils]: 110: Hoare triple {216202#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,268 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {215759#true} {216202#(< ~counter~0 19)} #100#return; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,268 INFO L272 TraceCheckUtils]: 105: Hoare triple {216202#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,268 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {215759#true} {216202#(< ~counter~0 19)} #98#return; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,269 INFO L290 TraceCheckUtils]: 102: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,269 INFO L290 TraceCheckUtils]: 101: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,269 INFO L272 TraceCheckUtils]: 100: Hoare triple {216202#(< ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,269 INFO L290 TraceCheckUtils]: 99: Hoare triple {216202#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,270 INFO L290 TraceCheckUtils]: 98: Hoare triple {216275#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {216202#(< ~counter~0 19)} is VALID [2022-04-27 13:16:30,270 INFO L290 TraceCheckUtils]: 97: Hoare triple {216275#(< ~counter~0 18)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {216275#(< ~counter~0 18)} is VALID [2022-04-27 13:16:30,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {216275#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {216275#(< ~counter~0 18)} is VALID [2022-04-27 13:16:30,271 INFO L290 TraceCheckUtils]: 95: Hoare triple {216285#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216275#(< ~counter~0 18)} is VALID [2022-04-27 13:16:30,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {216285#(< ~counter~0 17)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {216285#(< ~counter~0 17)} is VALID [2022-04-27 13:16:30,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {216285#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {216285#(< ~counter~0 17)} is VALID [2022-04-27 13:16:30,272 INFO L290 TraceCheckUtils]: 92: Hoare triple {216295#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {216285#(< ~counter~0 17)} is VALID [2022-04-27 13:16:30,273 INFO L290 TraceCheckUtils]: 91: Hoare triple {216295#(< ~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; {216295#(< ~counter~0 16)} is VALID [2022-04-27 13:16:30,273 INFO L290 TraceCheckUtils]: 90: Hoare triple {216295#(< ~counter~0 16)} assume !(~c~0 >= ~b~0); {216295#(< ~counter~0 16)} is VALID [2022-04-27 13:16:30,273 INFO L290 TraceCheckUtils]: 89: Hoare triple {216295#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {216295#(< ~counter~0 16)} is VALID [2022-04-27 13:16:30,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {216144#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216295#(< ~counter~0 16)} is VALID [2022-04-27 13:16:30,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {216144#(<= ~counter~0 14)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {216144#(<= ~counter~0 14)} assume !(~c~0 >= 2 * ~v~0); {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,275 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {215759#true} {216144#(<= ~counter~0 14)} #104#return; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,275 INFO L290 TraceCheckUtils]: 84: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,275 INFO L290 TraceCheckUtils]: 83: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,275 INFO L290 TraceCheckUtils]: 82: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,275 INFO L272 TraceCheckUtils]: 81: Hoare triple {216144#(<= ~counter~0 14)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,276 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {215759#true} {216144#(<= ~counter~0 14)} #102#return; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,276 INFO L290 TraceCheckUtils]: 79: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,276 INFO L272 TraceCheckUtils]: 76: Hoare triple {216144#(<= ~counter~0 14)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,276 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {215759#true} {216144#(<= ~counter~0 14)} #100#return; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,276 INFO L290 TraceCheckUtils]: 74: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,277 INFO L272 TraceCheckUtils]: 71: Hoare triple {216144#(<= ~counter~0 14)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,277 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {215759#true} {216144#(<= ~counter~0 14)} #98#return; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,277 INFO L290 TraceCheckUtils]: 69: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,277 INFO L290 TraceCheckUtils]: 67: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,277 INFO L272 TraceCheckUtils]: 66: Hoare triple {216144#(<= ~counter~0 14)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {216144#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {216071#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {216144#(<= ~counter~0 14)} is VALID [2022-04-27 13:16:30,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {216071#(<= ~counter~0 13)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:30,279 INFO L290 TraceCheckUtils]: 62: Hoare triple {216071#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:30,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {216061#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216071#(<= ~counter~0 13)} is VALID [2022-04-27 13:16:30,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {216061#(<= ~counter~0 12)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {216061#(<= ~counter~0 12)} is VALID [2022-04-27 13:16:30,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {216061#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {216061#(<= ~counter~0 12)} is VALID [2022-04-27 13:16:30,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {216051#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {216061#(<= ~counter~0 12)} is VALID [2022-04-27 13:16:30,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {216051#(<= ~counter~0 11)} ~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; {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:30,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {216051#(<= ~counter~0 11)} assume !(~c~0 >= ~b~0); {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:30,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {216051#(<= ~counter~0 11)} assume !!(#t~post7 < 20);havoc #t~post7; {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:30,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {216038#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {216051#(<= ~counter~0 11)} is VALID [2022-04-27 13:16:30,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {216038#(<= ~counter~0 10)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {216038#(<= ~counter~0 10)} assume !(~c~0 >= 2 * ~v~0); {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,284 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {215759#true} {216038#(<= ~counter~0 10)} #104#return; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,284 INFO L272 TraceCheckUtils]: 47: Hoare triple {216038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,284 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {215759#true} {216038#(<= ~counter~0 10)} #102#return; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,285 INFO L272 TraceCheckUtils]: 42: Hoare triple {216038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,285 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {215759#true} {216038#(<= ~counter~0 10)} #100#return; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,285 INFO L272 TraceCheckUtils]: 37: Hoare triple {216038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,286 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {215759#true} {216038#(<= ~counter~0 10)} #98#return; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,286 INFO L272 TraceCheckUtils]: 32: Hoare triple {216038#(<= ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {216038#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {215965#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {216038#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:30,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {215965#(<= ~counter~0 9)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:30,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {215965#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:30,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {215955#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215965#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:30,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {215955#(<= ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {215955#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:30,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {215955#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {215955#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:30,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {215945#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215955#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:30,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {215945#(<= ~counter~0 7)} ~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; {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:30,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {215945#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:30,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {215945#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:30,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {215932#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215945#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:30,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {215932#(<= ~counter~0 6)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:30,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {215932#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:30,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {215859#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215932#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:30,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {215859#(<= ~counter~0 5)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {215759#true} {215859#(<= ~counter~0 5)} #96#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {215859#(<= ~counter~0 5)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {215759#true} {215859#(<= ~counter~0 5)} #94#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {215759#true} assume true; {215759#true} is VALID [2022-04-27 13:16:30,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {215759#true} assume !(0 == ~cond); {215759#true} is VALID [2022-04-27 13:16:30,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {215759#true} ~cond := #in~cond; {215759#true} is VALID [2022-04-27 13:16:30,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {215859#(<= ~counter~0 5)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {215759#true} is VALID [2022-04-27 13:16:30,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {215859#(<= ~counter~0 5)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {215859#(<= ~counter~0 5)} call #t~ret9 := main(); {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215859#(<= ~counter~0 5)} {215759#true} #108#return; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {215859#(<= ~counter~0 5)} assume true; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {215759#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; {215859#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:30,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {215759#true} call ULTIMATE.init(); {215759#true} is VALID [2022-04-27 13:16:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 119 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-27 13:16:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190591401] [2022-04-27 13:16:30,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307154827] [2022-04-27 13:16:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307154827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:30,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:30,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-27 13:16:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055276416] [2022-04-27 13:16:30,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:30,313 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) Word has length 132 [2022-04-27 13:16:30,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:30,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-27 13:16:30,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:30,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:16:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:30,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:16:30,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:16:30,495 INFO L87 Difference]: Start difference. First operand 5265 states and 7068 transitions. Second operand has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-27 13:16:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:47,586 INFO L93 Difference]: Finished difference Result 5298 states and 7104 transitions. [2022-04-27 13:16:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 13:16:47,586 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) Word has length 132 [2022-04-27 13:16:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-27 13:16:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:16:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-27 13:16:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:16:47,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-27 13:16:48,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:49,402 INFO L225 Difference]: With dead ends: 5298 [2022-04-27 13:16:49,402 INFO L226 Difference]: Without dead ends: 5293 [2022-04-27 13:16:49,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=592, Invalid=1048, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 13:16:49,404 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 501 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:49,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 650 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:16:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2022-04-27 13:17:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5293. [2022-04-27 13:17:02,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:02,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5293 states. Second operand has 5293 states, 3516 states have (on average 1.1911262798634812) internal successors, (4188), 3532 states have internal predecessors, (4188), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:17:02,840 INFO L74 IsIncluded]: Start isIncluded. First operand 5293 states. Second operand has 5293 states, 3516 states have (on average 1.1911262798634812) internal successors, (4188), 3532 states have internal predecessors, (4188), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:17:02,843 INFO L87 Difference]: Start difference. First operand 5293 states. Second operand has 5293 states, 3516 states have (on average 1.1911262798634812) internal successors, (4188), 3532 states have internal predecessors, (4188), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:17:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:03,602 INFO L93 Difference]: Finished difference Result 5293 states and 7076 transitions. [2022-04-27 13:17:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7076 transitions. [2022-04-27 13:17:03,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:03,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:03,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 5293 states, 3516 states have (on average 1.1911262798634812) internal successors, (4188), 3532 states have internal predecessors, (4188), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) Second operand 5293 states. [2022-04-27 13:17:03,643 INFO L87 Difference]: Start difference. First operand has 5293 states, 3516 states have (on average 1.1911262798634812) internal successors, (4188), 3532 states have internal predecessors, (4188), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) Second operand 5293 states. [2022-04-27 13:17:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:04,407 INFO L93 Difference]: Finished difference Result 5293 states and 7076 transitions. [2022-04-27 13:17:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7076 transitions. [2022-04-27 13:17:04,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:04,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:04,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:04,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5293 states, 3516 states have (on average 1.1911262798634812) internal successors, (4188), 3532 states have internal predecessors, (4188), 1445 states have call successors, (1445), 333 states have call predecessors, (1445), 331 states have return successors, (1443), 1427 states have call predecessors, (1443), 1443 states have call successors, (1443) [2022-04-27 13:17:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7076 transitions. [2022-04-27 13:17:05,629 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7076 transitions. Word has length 132 [2022-04-27 13:17:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:05,629 INFO L495 AbstractCegarLoop]: Abstraction has 5293 states and 7076 transitions. [2022-04-27 13:17:05,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 9 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-27 13:17:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7076 transitions. [2022-04-27 13:17:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-27 13:17:05,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:05,632 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 11, 10, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-04-27 13:17:05,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:05,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 13:17:05,833 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash 465150719, now seen corresponding path program 1 times [2022-04-27 13:17:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:05,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56611758] [2022-04-27 13:17:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:05,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:05,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:05,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777631980] [2022-04-27 13:17:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:05,868 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:05,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-27 13:17:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:17:06,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:17:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:17:06,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:17:06,413 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:17:06,414 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:17:06,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:06,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-27 13:17:06,630 INFO L356 BasicCegarLoop]: Path program histogram: [3, 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:17:06,633 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:17:06,732 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 13:17:06,733 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 13:17:06,734 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:17:06,735 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:17:06,736 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 13:17:06,736 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 13:17:06,736 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:17:06,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:17:06 BoogieIcfgContainer [2022-04-27 13:17:06,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:17:06,737 INFO L158 Benchmark]: Toolchain (without parser) took 746130.33ms. Allocated memory was 200.3MB in the beginning and 640.7MB in the end (delta: 440.4MB). Free memory was 143.9MB in the beginning and 257.8MB in the end (delta: -113.9MB). Peak memory consumption was 327.1MB. Max. memory is 8.0GB. [2022-04-27 13:17:06,737 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 200.3MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:17:06,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.71ms. Allocated memory was 200.3MB in the beginning and 256.9MB in the end (delta: 56.6MB). Free memory was 143.7MB in the beginning and 226.4MB in the end (delta: -82.7MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-27 13:17:06,738 INFO L158 Benchmark]: Boogie Preprocessor took 27.26ms. Allocated memory is still 256.9MB. Free memory was 226.4MB in the beginning and 224.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:17:06,738 INFO L158 Benchmark]: RCFGBuilder took 276.94ms. Allocated memory is still 256.9MB. Free memory was 224.8MB in the beginning and 211.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 13:17:06,738 INFO L158 Benchmark]: TraceAbstraction took 745597.95ms. Allocated memory was 256.9MB in the beginning and 640.7MB in the end (delta: 383.8MB). Free memory was 210.7MB in the beginning and 257.8MB in the end (delta: -47.1MB). Peak memory consumption was 338.2MB. Max. memory is 8.0GB. [2022-04-27 13:17:06,739 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 200.3MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.71ms. Allocated memory was 200.3MB in the beginning and 256.9MB in the end (delta: 56.6MB). Free memory was 143.7MB in the beginning and 226.4MB in the end (delta: -82.7MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.26ms. Allocated memory is still 256.9MB. Free memory was 226.4MB in the beginning and 224.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 276.94ms. Allocated memory is still 256.9MB. Free memory was 224.8MB in the beginning and 211.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 745597.95ms. Allocated memory was 256.9MB in the beginning and 640.7MB in the end (delta: 383.8MB). Free memory was 210.7MB in the beginning and 257.8MB in the end (delta: -47.1MB). Peak memory consumption was 338.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=27, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=13, y=21] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=13, y=21] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=13, b=21, counter=0, p=1, q=0, r=0, s=1, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=21, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=13, y=21] [L34] COND TRUE counter++<20 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=13, b=21, c=13, counter=1, k=0, p=1, q=0, r=0, s=1, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=21, c=13, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=21, c=13, counter=2, k=0, p=1, q=0, r=0, s=1, x=13, y=21] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=13, y=21] [L34] COND TRUE counter++<20 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=21, b=13, c=21, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L48] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L48] COND TRUE counter++<20 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=21, b=13, c=21, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=21, b=13, c=21, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=21, b=13, c=8, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=13, x=13, y=21] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=13, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=13, x=13, y=21] [L34] COND TRUE counter++<20 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=13, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=13, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=13, b=8, c=13, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L48] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L48] COND TRUE counter++<20 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=13, b=8, c=13, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=13, b=8, c=13, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=13, b=8, c=5, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=8, x=13, y=21] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=8, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=8, x=13, y=21] [L34] COND TRUE counter++<20 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=8, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=12, counter++=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=8, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=8, b=5, c=8, counter=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L48] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=13, counter++=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L48] COND TRUE counter++<20 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=8, b=5, c=8, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=8, b=5, c=8, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=8, b=5, c=3, counter=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=14, counter++=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=14, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=5, x=13, y=21] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=5, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=15, counter++=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=5, x=13, y=21] [L34] COND TRUE counter++<20 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=5, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=16, counter++=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=5, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=5, b=3, c=5, counter=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=17, counter++=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L48] COND TRUE counter++<20 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=18, counter++=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=18, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=3, x=13, y=21] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=3, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=19, counter++=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=3, x=13, y=21] [L34] COND TRUE counter++<20 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=3, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=20, counter++=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=3, x=13, y=21] [L41] COND TRUE counter++<20 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=2, x=13, y=21] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=21, counter++=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=2, x=13, y=21] [L48] COND FALSE !(counter++<20) [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=2, x=13, y=21] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=22, counter++=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=2, x=13, y=21] [L41] COND FALSE !(counter++<20) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=2, x=13, y=21] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=23, counter++=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=2, x=13, y=21] [L34] COND FALSE !(counter++<20) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=23] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=23] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=23] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 745.4s, OverallIterations: 28, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 374.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 4407 SdHoareTripleChecker+Valid, 79.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4330 mSDsluCounter, 9888 SdHoareTripleChecker+Invalid, 79.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8188 mSDsCounter, 3185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9732 IncrementalHoareTripleChecker+Invalid, 12924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3185 mSolverCounterUnsat, 1700 mSDtfsCounter, 9732 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2900 GetRequests, 2320 SyntacticMatches, 20 SemanticMatches, 560 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6197 ImplicationChecksByTransitivity, 60.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5573occurred in iteration=25, InterpolantAutomatonStates: 501, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 111.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 2797 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 247.3s InterpolantComputationTime, 1690 NumberOfCodeBlocks, 1665 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2584 ConstructedInterpolants, 0 QuantifiedInterpolants, 15072 SizeOfPredicates, 155 NumberOfNonLiveVariables, 4998 ConjunctsInSsa, 636 ConjunctsInUnsatCore, 43 InterpolantComputations, 12 PerfectInterpolantSequences, 2731/3901 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:17:06,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...