/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:54:07,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:54:07,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:54:07,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:54:07,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:54:07,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:54:07,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:54:07,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:54:07,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:54:07,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:54:07,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:54:07,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:54:07,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:54:07,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:54:07,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:54:07,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:54:07,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:54:07,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:54:07,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:54:07,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:54:07,200 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:54:07,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:54:07,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:54:07,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:54:07,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:54:07,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:54:07,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:54:07,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:54:07,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:54:07,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:54:07,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:54:07,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:54:07,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:54:07,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:54:07,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:54:07,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:54:07,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:54:07,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:54:07,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:54:07,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:54:07,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:54:07,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:54:07,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:54:07,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:54:07,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:54:07,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:54:07,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:54:07,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:54:07,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:54:07,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:54:07,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:54:07,248 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:54:07,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:54:07,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:54:07,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:54:07,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:54:07,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:54:07,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:54:07,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:54:07,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:54:07,251 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:54:07,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:54:07,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:54:07,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:54:07,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:54:07,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:54:07,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:54:07,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:54:07,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:54:07,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:54:07,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:54:07,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:54:07,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:54:07,253 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:54:07,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:54:07,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:54:07,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:54:07,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:54:07,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:54:07,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:54:07,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:54:07,523 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:54:07,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-27 12:54:07,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bb5f2ea/ab8593d85abb438394f83bfb8cca15f4/FLAGf17715330 [2022-04-27 12:54:07,884 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:54:07,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-27 12:54:07,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bb5f2ea/ab8593d85abb438394f83bfb8cca15f4/FLAGf17715330 [2022-04-27 12:54:08,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bb5f2ea/ab8593d85abb438394f83bfb8cca15f4 [2022-04-27 12:54:08,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:54:08,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:54:08,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:54:08,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:54:08,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:54:08,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4a01a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08, skipping insertion in model container [2022-04-27 12:54:08,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:54:08,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:54:08,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c[490,503] [2022-04-27 12:54:08,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:54:08,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:54:08,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c[490,503] [2022-04-27 12:54:08,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:54:08,537 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:54:08,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08 WrapperNode [2022-04-27 12:54:08,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:54:08,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:54:08,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:54:08,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:54:08,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:54:08,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:54:08,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:54:08,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:54:08,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (1/1) ... [2022-04-27 12:54:08,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:54:08,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:08,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:54:08,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:54:08,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:54:08,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:54:08,657 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:54:08,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:54:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:54:08,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:54:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:54:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:54:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:54:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:54:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:54:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:54:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:54:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:54:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:54:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:54:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:54:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:54:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:54:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:54:08,745 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:54:08,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:54:08,897 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:54:08,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:54:08,907 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:54:08,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:54:08 BoogieIcfgContainer [2022-04-27 12:54:08,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:54:08,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:54:08,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:54:08,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:54:08,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:54:08" (1/3) ... [2022-04-27 12:54:08,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7df64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:54:08, skipping insertion in model container [2022-04-27 12:54:08,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:54:08" (2/3) ... [2022-04-27 12:54:08,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7df64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:54:08, skipping insertion in model container [2022-04-27 12:54:08,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:54:08" (3/3) ... [2022-04-27 12:54:08,915 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound5.c [2022-04-27 12:54:08,926 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:54:08,927 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:54:08,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:54:08,976 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@59a5fcf8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20704ec1 [2022-04-27 12:54:08,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:54:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:54:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:54:08,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:08,992 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:08,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-27 12:54:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:09,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408652945] [2022-04-27 12:54:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:54:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:54:09,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:54:09,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:54:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:54:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:54:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:54:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:54:09,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:54:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:54:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:54:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:54:09,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:54:09,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:54:09,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:54:09,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:54:09,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-27 12:54:09,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-27 12:54:09,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:54:09,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:54:09,216 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:54:09,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,217 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:54:09,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-27 12:54:09,217 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:54:09,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,218 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:54:09,219 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:54:09,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:54:09,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:54:09,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:54:09,225 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:54:09,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:54:09,225 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-27 12:54:09,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:54:09,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:54:09,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:54:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:54:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:09,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408652945] [2022-04-27 12:54:09,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408652945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:54:09,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:54:09,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:54:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510982250] [2022-04-27 12:54:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:54:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:54:09,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:09,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:09,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:09,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:54:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:54:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:54:09,327 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:09,594 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-27 12:54:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:54:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:54:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:54:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:54:09,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-27 12:54:09,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:09,792 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:54:09,793 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:54:09,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:54:09,800 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:09,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:54:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:54:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:54:09,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:09,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:09,830 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:09,830 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:09,834 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:54:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:54:09,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:09,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:09,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:54:09,837 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:54:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:09,840 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:54:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:54:09,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:09,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:09,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:09,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-27 12:54:09,846 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-27 12:54:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:09,846 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-27 12:54:09,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 12:54:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:54:09,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:09,848 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:09,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:54:09,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-27 12:54:09,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:09,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91833] [2022-04-27 12:54:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:09,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326275003] [2022-04-27 12:54:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:09,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:09,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:54:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:09,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:54:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:10,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:10,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2022-04-27 12:54:10,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#(<= ~counter~0 0)} {292#true} #98#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#(<= ~counter~0 0)} call #t~ret8 := main(); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #78#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #80#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {300#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,358 INFO L272 TraceCheckUtils]: 17: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,360 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #82#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,364 INFO L272 TraceCheckUtils]: 22: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,366 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #84#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:10,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {379#(<= |main_#t~post6| 0)} is VALID [2022-04-27 12:54:10,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {379#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {293#false} is VALID [2022-04-27 12:54:10,368 INFO L272 TraceCheckUtils]: 29: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {293#false} is VALID [2022-04-27 12:54:10,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2022-04-27 12:54:10,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2022-04-27 12:54:10,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-27 12:54:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:54:10,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:54:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:10,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91833] [2022-04-27 12:54:10,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:10,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326275003] [2022-04-27 12:54:10,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326275003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:54:10,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:54:10,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:54:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965201167] [2022-04-27 12:54:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:54:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:54:10,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:10,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:10,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:10,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:54:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:54:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:54:10,405 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:10,519 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 12:54:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:54:10,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:54:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:54:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:54:10,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-27 12:54:10,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:10,580 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:54:10,580 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:54:10,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:54:10,581 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:10,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:54:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:54:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:54:10,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:10,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:10,592 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:10,593 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:10,595 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:54:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:54:10,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:10,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:10,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:54:10,597 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:54:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:10,600 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:54:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:54:10,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:10,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:10,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:10,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-27 12:54:10,604 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-27 12:54:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:10,604 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-27 12:54:10,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:54:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:54:10,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:10,606 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:10,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:10,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:10,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-27 12:54:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:10,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77447340] [2022-04-27 12:54:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:10,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:10,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107792770] [2022-04-27 12:54:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:10,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:10,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:10,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:10,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:54:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:10,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:54:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:10,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:11,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:54:11,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:54:11,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:54:11,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:54:11,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {587#true} is VALID [2022-04-27 12:54:11,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:54:11,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:54:11,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:54:11,119 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:54:11,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:11,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:11,121 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:54:11,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:54:11,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:54:11,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,122 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,123 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:54:11,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:54:11,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,123 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:54:11,125 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:54:11,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:54:11,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:54:11,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:54:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:54:11,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:11,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:54:11,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:54:11,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:54:11,385 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:54:11,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:54:11,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,387 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:54:11,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:54:11,387 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,388 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:54:11,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:54:11,389 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:11,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:54:11,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:11,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:11,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:54:11,391 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:54:11,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:54:11,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:54:11,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:54:11,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {587#true} is VALID [2022-04-27 12:54:11,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:54:11,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:54:11,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:54:11,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:54:11,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:54:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:54:11,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77447340] [2022-04-27 12:54:11,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:11,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107792770] [2022-04-27 12:54:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107792770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:54:11,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:54:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 12:54:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706742962] [2022-04-27 12:54:11,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:54:11,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:11,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:11,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:11,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:54:11,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:11,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:54:11,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:54:11,419 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:11,725 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 12:54:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:54:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:54:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:54:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:54:11,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 12:54:11,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:11,799 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:54:11,799 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 12:54:11,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:54:11,800 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:11,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:54:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 12:54:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-27 12:54:11,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:11,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:11,822 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:11,823 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:11,826 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:54:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:54:11,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:11,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:11,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:54:11,827 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:54:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:11,830 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:54:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:54:11,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:11,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:11,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:11,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-27 12:54:11,833 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-27 12:54:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:11,833 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-27 12:54:11,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-27 12:54:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:54:11,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:11,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:11,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:54:12,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-27 12:54:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:12,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227767355] [2022-04-27 12:54:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:12,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:12,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214097834] [2022-04-27 12:54:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:12,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:12,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:12,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:54:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:12,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:54:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:12,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:12,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:54:12,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:54:12,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:54:12,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:54:12,381 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:54:12,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:12,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:12,383 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} {1027#true} #80#return; {1079#(<= 1 main_~y~0)} is VALID [2022-04-27 12:54:12,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:12,384 INFO L272 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,385 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #82#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:12,386 INFO L272 TraceCheckUtils]: 22: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,395 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #84#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:12,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {1083#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:12,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:54:12,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:54:12,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:54:12,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:54:12,399 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:12,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:12,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:54:12,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:54:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:54:12,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:12,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:54:12,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:54:12,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:12,596 INFO L272 TraceCheckUtils]: 32: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:12,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:54:12,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:54:12,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {1027#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:54:12,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {1027#true} assume !!(#t~post6 < 5);havoc #t~post6; {1027#true} is VALID [2022-04-27 12:54:12,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {1027#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1027#true} is VALID [2022-04-27 12:54:12,601 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1027#true} #84#return; {1027#true} is VALID [2022-04-27 12:54:12,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,603 INFO L272 TraceCheckUtils]: 22: Hoare triple {1027#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,604 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1027#true} #82#return; {1027#true} is VALID [2022-04-27 12:54:12,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,604 INFO L272 TraceCheckUtils]: 17: Hoare triple {1027#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {1027#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1027#true} is VALID [2022-04-27 12:54:12,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1027#true} {1027#true} #80#return; {1027#true} is VALID [2022-04-27 12:54:12,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:54:12,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:54:12,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:54:12,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:54:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:54:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227767355] [2022-04-27 12:54:12,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214097834] [2022-04-27 12:54:12,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214097834] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:54:12,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:54:12,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 12:54:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134142965] [2022-04-27 12:54:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:54:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:54:12,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:12,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:54:12,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:12,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:54:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:54:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:54:12,631 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:54:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:12,863 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:54:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:54:12,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:54:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:54:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:54:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:54:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:54:12,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:54:12,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:12,923 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:54:12,923 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 12:54:12,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:54:12,924 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:12,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:54:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 12:54:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 12:54:12,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:12,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:12,946 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:12,946 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:12,948 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:54:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:54:12,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:12,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:12,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:54:12,949 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:54:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:12,952 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:54:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:54:12,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:12,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:12,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:12,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 12:54:12,954 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-27 12:54:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:12,955 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 12:54:12,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:54:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:54:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:54:12,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:12,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:12,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:13,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-27 12:54:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:13,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290647311] [2022-04-27 12:54:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:13,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:13,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898911362] [2022-04-27 12:54:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:13,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:13,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:13,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:13,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:54:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:13,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:54:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:13,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:13,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2022-04-27 12:54:13,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1468#(<= ~counter~0 0)} {1460#true} #98#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1468#(<= ~counter~0 0)} call #t~ret8 := main(); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #78#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,436 INFO L272 TraceCheckUtils]: 11: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #80#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {1468#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,438 INFO L272 TraceCheckUtils]: 17: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,440 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #82#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,442 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #84#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:54:13,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {1468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:13,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {1547#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:13,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {1547#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:54:13,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {1547#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1557#(<= |main_#t~post7| 1)} is VALID [2022-04-27 12:54:13,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {1557#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1461#false} is VALID [2022-04-27 12:54:13,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1461#false} is VALID [2022-04-27 12:54:13,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1461#false} is VALID [2022-04-27 12:54:13,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(#t~post6 < 5);havoc #t~post6; {1461#false} is VALID [2022-04-27 12:54:13,445 INFO L272 TraceCheckUtils]: 35: Hoare triple {1461#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1461#false} is VALID [2022-04-27 12:54:13,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2022-04-27 12:54:13,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume 0 == ~cond; {1461#false} is VALID [2022-04-27 12:54:13,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-27 12:54:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:54:13,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:54:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:13,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290647311] [2022-04-27 12:54:13,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:13,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898911362] [2022-04-27 12:54:13,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898911362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:54:13,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:54:13,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:54:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261021143] [2022-04-27 12:54:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:54:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:54:13,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:13,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:13,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:13,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:54:13,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:54:13,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:54:13,476 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:13,604 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:54:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:54:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:54:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:54:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:54:13,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 12:54:13,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:13,666 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:54:13,666 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 12:54:13,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:54:13,668 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:13,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:54:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 12:54:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 12:54:13,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:13,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:13,690 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:13,690 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:13,692 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:54:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:54:13,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:13,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:13,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:54:13,693 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:54:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:13,695 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:54:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:54:13,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:13,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:13,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:13,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:54:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-27 12:54:13,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-27 12:54:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:13,698 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-27 12:54:13,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:54:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:54:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 12:54:13,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:13,699 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:13,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:54:13,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:13,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-27 12:54:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:13,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714172293] [2022-04-27 12:54:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:13,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:13,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231704683] [2022-04-27 12:54:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:13,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:13,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:13,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:13,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:54:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:14,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:54:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:14,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:14,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:54:14,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:54:14,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:54:14,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:14,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:14,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} {1828#true} #80#return; {1880#(<= 1 main_~y~0)} is VALID [2022-04-27 12:54:14,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {1880#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,308 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,308 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,309 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,311 INFO L272 TraceCheckUtils]: 32: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,312 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:54:14,313 INFO L272 TraceCheckUtils]: 37: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:14,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:14,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:54:14,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:54:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:54:14,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:14,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:54:14,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:54:14,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:14,527 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:14,528 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,528 INFO L272 TraceCheckUtils]: 32: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,531 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,532 INFO L272 TraceCheckUtils]: 22: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,532 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,533 INFO L272 TraceCheckUtils]: 17: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:54:14,534 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1828#true} {1828#true} #80#return; {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:54:14,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:54:14,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:54:14,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:54:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:54:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714172293] [2022-04-27 12:54:14,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231704683] [2022-04-27 12:54:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231704683] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:54:14,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:54:14,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:54:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363452030] [2022-04-27 12:54:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:54:14,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 12:54:14,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:14,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:54:14,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:14,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:54:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:14,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:54:14,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:54:14,570 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:54:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:14,888 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 12:54:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:54:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 12:54:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:54:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:54:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:54:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:54:14,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:54:14,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:14,958 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:54:14,958 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 12:54:14,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:54:14,960 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:14,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:54:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 12:54:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 12:54:14,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:14,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:14,993 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:14,993 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:14,995 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:54:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:54:14,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:14,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:14,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:54:14,997 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:54:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:14,999 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:54:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:54:14,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:15,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:15,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:15,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 12:54:15,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-27 12:54:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:15,002 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 12:54:15,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:54:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 12:54:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 12:54:15,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:15,003 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:15,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:15,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:15,227 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-27 12:54:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999228907] [2022-04-27 12:54:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:15,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:15,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670401017] [2022-04-27 12:54:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:15,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:15,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:15,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:54:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:15,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:54:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:15,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:15,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:54:15,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:54:15,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:54:15,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:54:15,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2359#true} is VALID [2022-04-27 12:54:15,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:54:15,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:15,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:15,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} {2359#true} #78#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:54:15,579 INFO L272 TraceCheckUtils]: 11: Hoare triple {2396#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,580 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2396#(<= 1 main_~x~0)} #80#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:54:15,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,581 INFO L272 TraceCheckUtils]: 17: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,582 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,582 INFO L272 TraceCheckUtils]: 22: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,583 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,585 INFO L272 TraceCheckUtils]: 32: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,596 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,596 INFO L272 TraceCheckUtils]: 37: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,597 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:54:15,598 INFO L272 TraceCheckUtils]: 42: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:15,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:15,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:54:15,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:54:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:54:15,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:15,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:54:15,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:54:15,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:15,816 INFO L272 TraceCheckUtils]: 42: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:15,817 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,817 INFO L272 TraceCheckUtils]: 37: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,818 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,818 INFO L272 TraceCheckUtils]: 32: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,821 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,821 INFO L272 TraceCheckUtils]: 22: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,822 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,822 INFO L272 TraceCheckUtils]: 17: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:54:15,823 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2359#true} #80#return; {2359#true} is VALID [2022-04-27 12:54:15,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,823 INFO L272 TraceCheckUtils]: 11: Hoare triple {2359#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} #78#return; {2359#true} is VALID [2022-04-27 12:54:15,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:54:15,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:54:15,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:54:15,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2359#true} is VALID [2022-04-27 12:54:15,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:54:15,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:54:15,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:54:15,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:54:15,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:54:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:54:15,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:15,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999228907] [2022-04-27 12:54:15,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:15,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670401017] [2022-04-27 12:54:15,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670401017] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:54:15,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:54:15,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:54:15,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99617513] [2022-04-27 12:54:15,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:54:15,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:54:15,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:15,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:54:15,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:15,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:54:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:15,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:54:15,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:54:15,860 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:54:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:16,086 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 12:54:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:54:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:54:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:54:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:54:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:54:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:54:16,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:54:16,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:16,165 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:54:16,165 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 12:54:16,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:54:16,166 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:16,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:54:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 12:54:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 12:54:16,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:16,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:16,201 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:16,201 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:16,205 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:54:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:54:16,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:16,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:16,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:54:16,206 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:54:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:16,208 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:54:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:54:16,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:16,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:16,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:16,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-27 12:54:16,212 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-27 12:54:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:16,213 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-27 12:54:16,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:54:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 12:54:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 12:54:16,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:16,214 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:16,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:16,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:16,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-27 12:54:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:16,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039258009] [2022-04-27 12:54:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:16,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:16,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078881075] [2022-04-27 12:54:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:16,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:16,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:16,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:54:16,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:54:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:16,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:54:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:54:16,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:54:23,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #98#return; {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret8 := main(); {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {2938#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {2938#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:54:23,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:54:23,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:54:23,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2938#true} {2938#true} #78#return; {2938#true} is VALID [2022-04-27 12:54:23,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {2938#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {2938#true} ~cond := #in~cond; {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:54:23,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:23,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:54:23,030 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} {2938#true} #80#return; {2990#(<= 1 main_~y~0)} is VALID [2022-04-27 12:54:23,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {2990#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:54:23,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:54:23,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:54:23,031 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #82#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,031 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:54:23,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:54:23,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:54:23,032 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,035 INFO L272 TraceCheckUtils]: 32: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:54:23,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:54:23,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:54:23,036 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #86#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,039 INFO L272 TraceCheckUtils]: 37: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:23,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:23,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:23,041 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #88#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,041 INFO L272 TraceCheckUtils]: 42: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:54:23,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:23,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:23,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:54:23,043 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #90#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:54:23,044 INFO L272 TraceCheckUtils]: 47: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:54:23,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:54:23,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {3094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2939#false} is VALID [2022-04-27 12:54:23,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-04-27 12:54:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 12:54:23,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:04,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039258009] [2022-04-27 12:55:04,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:04,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078881075] [2022-04-27 12:55:04,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078881075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:55:04,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:55:04,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 12:55:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602780716] [2022-04-27 12:55:04,086 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:55:04,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:04,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:55:04,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:04,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:55:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:55:04,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:55:04,122 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:55:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:05,823 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 12:55:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:55:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:55:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:55:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 12:55:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:55:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 12:55:05,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 12:55:05,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:05,898 INFO L225 Difference]: With dead ends: 65 [2022-04-27 12:55:05,898 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 12:55:05,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:55:05,899 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:05,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:55:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 12:55:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 12:55:05,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:05,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:55:05,928 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:55:05,928 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:55:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:05,930 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 12:55:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 12:55:05,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:05,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:05,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 12:55:05,931 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 12:55:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:05,934 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 12:55:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 12:55:05,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:05,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:05,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:05,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:55:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-27 12:55:05,936 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-27 12:55:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:05,937 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-27 12:55:05,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:55:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-27 12:55:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 12:55:05,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:05,938 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:05,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:55:06,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:06,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-27 12:55:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:06,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244468289] [2022-04-27 12:55:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:06,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179061424] [2022-04-27 12:55:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:06,183 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:06,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:55:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:06,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:55:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:06,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:06,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-27 12:55:06,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3442#(<= ~counter~0 0)} {3434#true} #98#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {3442#(<= ~counter~0 0)} call #t~ret8 := main(); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {3442#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #78#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,563 INFO L272 TraceCheckUtils]: 11: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,564 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #80#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {3442#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,565 INFO L272 TraceCheckUtils]: 17: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,568 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #82#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,569 INFO L272 TraceCheckUtils]: 22: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,570 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #84#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:06,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {3442#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 12:55:06,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {3521#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 12:55:06,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {3521#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 12:55:06,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {3521#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {3531#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,573 INFO L272 TraceCheckUtils]: 32: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,574 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #86#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,575 INFO L272 TraceCheckUtils]: 37: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,577 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #88#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,577 INFO L272 TraceCheckUtils]: 42: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,579 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #90#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,580 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,581 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #92#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {3531#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {3531#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {3531#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3604#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:55:06,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {3604#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {3435#false} is VALID [2022-04-27 12:55:06,583 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-27 12:55:06,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-27 12:55:06,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-27 12:55:06,583 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-27 12:55:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:55:06,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:06,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-27 12:55:06,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-27 12:55:06,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-27 12:55:06,891 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-27 12:55:06,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {3632#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {3435#false} is VALID [2022-04-27 12:55:06,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {3636#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3632#(< |main_#t~post6| 5)} is VALID [2022-04-27 12:55:06,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {3636#(< ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {3636#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,892 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3434#true} {3636#(< ~counter~0 5)} #92#return; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L272 TraceCheckUtils]: 47: Hoare triple {3636#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3434#true} {3636#(< ~counter~0 5)} #90#return; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,893 INFO L272 TraceCheckUtils]: 42: Hoare triple {3636#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,894 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3434#true} {3636#(< ~counter~0 5)} #88#return; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,894 INFO L272 TraceCheckUtils]: 37: Hoare triple {3636#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,896 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3434#true} {3636#(< ~counter~0 5)} #86#return; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,896 INFO L272 TraceCheckUtils]: 32: Hoare triple {3636#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {3636#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {3709#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3636#(< ~counter~0 5)} is VALID [2022-04-27 12:55:06,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {3709#(< ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3709#(< ~counter~0 4)} is VALID [2022-04-27 12:55:06,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {3709#(< ~counter~0 4)} is VALID [2022-04-27 12:55:06,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {3531#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3709#(< ~counter~0 4)} is VALID [2022-04-27 12:55:06,903 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3434#true} {3531#(<= ~counter~0 2)} #84#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,904 INFO L272 TraceCheckUtils]: 22: Hoare triple {3531#(<= ~counter~0 2)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,904 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3434#true} {3531#(<= ~counter~0 2)} #82#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {3531#(<= ~counter~0 2)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {3531#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3434#true} {3531#(<= ~counter~0 2)} #80#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,905 INFO L272 TraceCheckUtils]: 11: Hoare triple {3531#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3434#true} {3531#(<= ~counter~0 2)} #78#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 12:55:06,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 12:55:06,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 12:55:06,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {3531#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-27 12:55:06,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {3531#(<= ~counter~0 2)} call #t~ret8 := main(); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3531#(<= ~counter~0 2)} {3434#true} #98#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:06,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-27 12:55:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:55:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:06,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244468289] [2022-04-27 12:55:06,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179061424] [2022-04-27 12:55:06,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179061424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:55:06,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:55:06,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 12:55:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677998136] [2022-04-27 12:55:06,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 60 [2022-04-27 12:55:06,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:06,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:06,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:06,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:55:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:55:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:55:06,974 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:07,376 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2022-04-27 12:55:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:55:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 60 [2022-04-27 12:55:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-04-27 12:55:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-04-27 12:55:07,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 130 transitions. [2022-04-27 12:55:07,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:07,484 INFO L225 Difference]: With dead ends: 173 [2022-04-27 12:55:07,484 INFO L226 Difference]: Without dead ends: 165 [2022-04-27 12:55:07,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:55:07,485 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:07,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 187 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:55:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-27 12:55:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2022-04-27 12:55:07,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:07,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 159 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 36 states have call successors, (36), 22 states have call predecessors, (36), 21 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:55:07,571 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 159 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 36 states have call successors, (36), 22 states have call predecessors, (36), 21 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:55:07,572 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 159 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 36 states have call successors, (36), 22 states have call predecessors, (36), 21 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:55:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:07,577 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2022-04-27 12:55:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2022-04-27 12:55:07,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:07,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:07,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 36 states have call successors, (36), 22 states have call predecessors, (36), 21 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 165 states. [2022-04-27 12:55:07,580 INFO L87 Difference]: Start difference. First operand has 159 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 36 states have call successors, (36), 22 states have call predecessors, (36), 21 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 165 states. [2022-04-27 12:55:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:07,586 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2022-04-27 12:55:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2022-04-27 12:55:07,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:07,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:07,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:07,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 36 states have call successors, (36), 22 states have call predecessors, (36), 21 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:55:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2022-04-27 12:55:07,601 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 60 [2022-04-27 12:55:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:07,602 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2022-04-27 12:55:07,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2022-04-27 12:55:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 12:55:07,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:07,603 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:07,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 12:55:07,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 12:55:07,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-27 12:55:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:07,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498122828] [2022-04-27 12:55:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:07,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:07,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972963058] [2022-04-27 12:55:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:07,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:07,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:07,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:07,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:55:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:07,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:55:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:07,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:08,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {4613#true} call ULTIMATE.init(); {4613#true} is VALID [2022-04-27 12:55:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {4613#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; {4613#true} is VALID [2022-04-27 12:55:08,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4613#true} {4613#true} #98#return; {4613#true} is VALID [2022-04-27 12:55:08,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {4613#true} call #t~ret8 := main(); {4613#true} is VALID [2022-04-27 12:55:08,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {4613#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4613#true} is VALID [2022-04-27 12:55:08,133 INFO L272 TraceCheckUtils]: 6: Hoare triple {4613#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {4613#true} ~cond := #in~cond; {4639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:55:08,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {4639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:55:08,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {4643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:55:08,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4643#(not (= |assume_abort_if_not_#in~cond| 0))} {4613#true} #78#return; {4650#(<= 1 main_~x~0)} is VALID [2022-04-27 12:55:08,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {4650#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,136 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4613#true} {4650#(<= 1 main_~x~0)} #80#return; {4650#(<= 1 main_~x~0)} is VALID [2022-04-27 12:55:08,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {4650#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,136 INFO L272 TraceCheckUtils]: 17: Hoare triple {4669#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,137 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4613#true} {4669#(<= 1 main_~a~0)} #82#return; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,137 INFO L272 TraceCheckUtils]: 22: Hoare triple {4669#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,138 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4613#true} {4669#(<= 1 main_~a~0)} #84#return; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {4669#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {4669#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {4669#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {4709#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {4709#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,140 INFO L272 TraceCheckUtils]: 32: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,141 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #86#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,141 INFO L272 TraceCheckUtils]: 37: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,142 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #88#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,142 INFO L272 TraceCheckUtils]: 42: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,143 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #90#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,143 INFO L272 TraceCheckUtils]: 47: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,144 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #92#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {4709#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {4709#(<= 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; {4782#(<= 1 main_~b~0)} is VALID [2022-04-27 12:55:08,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {4782#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4782#(<= 1 main_~b~0)} is VALID [2022-04-27 12:55:08,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {4782#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {4782#(<= 1 main_~b~0)} is VALID [2022-04-27 12:55:08,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {4782#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4614#false} is VALID [2022-04-27 12:55:08,146 INFO L272 TraceCheckUtils]: 57: Hoare triple {4614#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4614#false} is VALID [2022-04-27 12:55:08,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {4614#false} ~cond := #in~cond; {4614#false} is VALID [2022-04-27 12:55:08,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {4614#false} assume 0 == ~cond; {4614#false} is VALID [2022-04-27 12:55:08,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {4614#false} assume !false; {4614#false} is VALID [2022-04-27 12:55:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:55:08,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:08,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {4614#false} assume !false; {4614#false} is VALID [2022-04-27 12:55:08,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {4614#false} assume 0 == ~cond; {4614#false} is VALID [2022-04-27 12:55:08,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {4614#false} ~cond := #in~cond; {4614#false} is VALID [2022-04-27 12:55:08,435 INFO L272 TraceCheckUtils]: 57: Hoare triple {4614#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4614#false} is VALID [2022-04-27 12:55:08,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {4782#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4614#false} is VALID [2022-04-27 12:55:08,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {4782#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {4782#(<= 1 main_~b~0)} is VALID [2022-04-27 12:55:08,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {4782#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4782#(<= 1 main_~b~0)} is VALID [2022-04-27 12:55:08,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {4709#(<= 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; {4782#(<= 1 main_~b~0)} is VALID [2022-04-27 12:55:08,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {4709#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,438 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #92#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,439 INFO L272 TraceCheckUtils]: 47: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,439 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #90#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,440 INFO L272 TraceCheckUtils]: 42: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,440 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #88#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,441 INFO L272 TraceCheckUtils]: 37: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,441 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#true} {4709#(<= 1 main_~c~0)} #86#return; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,442 INFO L272 TraceCheckUtils]: 32: Hoare triple {4709#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {4709#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {4709#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {4669#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4709#(<= 1 main_~c~0)} is VALID [2022-04-27 12:55:08,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {4669#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {4669#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,444 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4613#true} {4669#(<= 1 main_~a~0)} #84#return; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,444 INFO L272 TraceCheckUtils]: 22: Hoare triple {4669#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,445 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4613#true} {4669#(<= 1 main_~a~0)} #82#return; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,445 INFO L272 TraceCheckUtils]: 17: Hoare triple {4669#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {4650#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4669#(<= 1 main_~a~0)} is VALID [2022-04-27 12:55:08,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4613#true} {4650#(<= 1 main_~x~0)} #80#return; {4650#(<= 1 main_~x~0)} is VALID [2022-04-27 12:55:08,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {4613#true} assume !(0 == ~cond); {4613#true} is VALID [2022-04-27 12:55:08,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {4613#true} ~cond := #in~cond; {4613#true} is VALID [2022-04-27 12:55:08,446 INFO L272 TraceCheckUtils]: 11: Hoare triple {4650#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4643#(not (= |assume_abort_if_not_#in~cond| 0))} {4613#true} #78#return; {4650#(<= 1 main_~x~0)} is VALID [2022-04-27 12:55:08,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {4643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:55:08,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {4963#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:55:08,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {4613#true} ~cond := #in~cond; {4963#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:55:08,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {4613#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4613#true} is VALID [2022-04-27 12:55:08,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {4613#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4613#true} is VALID [2022-04-27 12:55:08,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {4613#true} call #t~ret8 := main(); {4613#true} is VALID [2022-04-27 12:55:08,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4613#true} {4613#true} #98#return; {4613#true} is VALID [2022-04-27 12:55:08,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {4613#true} assume true; {4613#true} is VALID [2022-04-27 12:55:08,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4613#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; {4613#true} is VALID [2022-04-27 12:55:08,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {4613#true} call ULTIMATE.init(); {4613#true} is VALID [2022-04-27 12:55:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:55:08,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:08,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498122828] [2022-04-27 12:55:08,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:08,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972963058] [2022-04-27 12:55:08,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972963058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:55:08,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:55:08,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 12:55:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676031293] [2022-04-27 12:55:08,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-27 12:55:08,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:08,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:55:08,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:08,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:55:08,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:08,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:55:08,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:55:08,487 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:55:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:09,456 INFO L93 Difference]: Finished difference Result 225 states and 292 transitions. [2022-04-27 12:55:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:55:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-27 12:55:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:55:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 12:55:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:55:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 12:55:09,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-27 12:55:09,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:09,587 INFO L225 Difference]: With dead ends: 225 [2022-04-27 12:55:09,587 INFO L226 Difference]: Without dead ends: 211 [2022-04-27 12:55:09,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:55:09,588 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:09,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 370 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:55:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-27 12:55:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 189. [2022-04-27 12:55:09,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:09,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 189 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 124 states have internal predecessors, (148), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:09,775 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 189 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 124 states have internal predecessors, (148), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:09,776 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 189 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 124 states have internal predecessors, (148), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:09,783 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2022-04-27 12:55:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-04-27 12:55:09,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:09,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:09,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 124 states have internal predecessors, (148), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand 211 states. [2022-04-27 12:55:09,785 INFO L87 Difference]: Start difference. First operand has 189 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 124 states have internal predecessors, (148), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand 211 states. [2022-04-27 12:55:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:09,791 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2022-04-27 12:55:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-04-27 12:55:09,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:09,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:09,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:09,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 124 states have internal predecessors, (148), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2022-04-27 12:55:09,798 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 61 [2022-04-27 12:55:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:09,798 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2022-04-27 12:55:09,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 12:55:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2022-04-27 12:55:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 12:55:09,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:09,799 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:09,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:55:10,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:55:10,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash 428029148, now seen corresponding path program 1 times [2022-04-27 12:55:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:10,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824471604] [2022-04-27 12:55:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:10,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:10,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856960198] [2022-04-27 12:55:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:10,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:10,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 12:55:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:10,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:55:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:10,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:10,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6029#true} is VALID [2022-04-27 12:55:10,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {6029#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; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {6037#(<= ~counter~0 0)} assume true; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6037#(<= ~counter~0 0)} {6029#true} #98#return; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {6037#(<= ~counter~0 0)} call #t~ret8 := main(); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {6037#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {6037#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {6037#(<= ~counter~0 0)} ~cond := #in~cond; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {6037#(<= ~counter~0 0)} assume !(0 == ~cond); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {6037#(<= ~counter~0 0)} assume true; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6037#(<= ~counter~0 0)} {6037#(<= ~counter~0 0)} #78#return; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,327 INFO L272 TraceCheckUtils]: 11: Hoare triple {6037#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {6037#(<= ~counter~0 0)} ~cond := #in~cond; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {6037#(<= ~counter~0 0)} assume !(0 == ~cond); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {6037#(<= ~counter~0 0)} assume true; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,328 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6037#(<= ~counter~0 0)} {6037#(<= ~counter~0 0)} #80#return; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {6037#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,329 INFO L272 TraceCheckUtils]: 17: Hoare triple {6037#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {6037#(<= ~counter~0 0)} ~cond := #in~cond; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {6037#(<= ~counter~0 0)} assume !(0 == ~cond); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {6037#(<= ~counter~0 0)} assume true; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,330 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6037#(<= ~counter~0 0)} {6037#(<= ~counter~0 0)} #82#return; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,330 INFO L272 TraceCheckUtils]: 22: Hoare triple {6037#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {6037#(<= ~counter~0 0)} ~cond := #in~cond; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {6037#(<= ~counter~0 0)} assume !(0 == ~cond); {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {6037#(<= ~counter~0 0)} assume true; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,331 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6037#(<= ~counter~0 0)} {6037#(<= ~counter~0 0)} #84#return; {6037#(<= ~counter~0 0)} is VALID [2022-04-27 12:55:10,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {6037#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6116#(<= ~counter~0 1)} is VALID [2022-04-27 12:55:10,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {6116#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6116#(<= ~counter~0 1)} is VALID [2022-04-27 12:55:10,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {6116#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6116#(<= ~counter~0 1)} is VALID [2022-04-27 12:55:10,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {6116#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {6126#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,333 INFO L272 TraceCheckUtils]: 32: Hoare triple {6126#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {6126#(<= ~counter~0 2)} ~cond := #in~cond; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {6126#(<= ~counter~0 2)} assume !(0 == ~cond); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {6126#(<= ~counter~0 2)} assume true; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,335 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6126#(<= ~counter~0 2)} {6126#(<= ~counter~0 2)} #86#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,335 INFO L272 TraceCheckUtils]: 37: Hoare triple {6126#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {6126#(<= ~counter~0 2)} ~cond := #in~cond; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {6126#(<= ~counter~0 2)} assume !(0 == ~cond); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {6126#(<= ~counter~0 2)} assume true; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,337 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6126#(<= ~counter~0 2)} {6126#(<= ~counter~0 2)} #88#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,338 INFO L272 TraceCheckUtils]: 42: Hoare triple {6126#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {6126#(<= ~counter~0 2)} ~cond := #in~cond; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {6126#(<= ~counter~0 2)} assume !(0 == ~cond); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {6126#(<= ~counter~0 2)} assume true; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,339 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6126#(<= ~counter~0 2)} {6126#(<= ~counter~0 2)} #90#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,340 INFO L272 TraceCheckUtils]: 47: Hoare triple {6126#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {6126#(<= ~counter~0 2)} ~cond := #in~cond; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {6126#(<= ~counter~0 2)} assume !(0 == ~cond); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {6126#(<= ~counter~0 2)} assume true; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,341 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6126#(<= ~counter~0 2)} {6126#(<= ~counter~0 2)} #92#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {6126#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {6126#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6196#(<= |main_#t~post7| 2)} is VALID [2022-04-27 12:55:10,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {6196#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {6030#false} is VALID [2022-04-27 12:55:10,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {6030#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; {6030#false} is VALID [2022-04-27 12:55:10,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {6030#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6030#false} is VALID [2022-04-27 12:55:10,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {6030#false} assume !!(#t~post6 < 5);havoc #t~post6; {6030#false} is VALID [2022-04-27 12:55:10,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {6030#false} assume !(0 != ~b~0); {6030#false} is VALID [2022-04-27 12:55:10,344 INFO L272 TraceCheckUtils]: 59: Hoare triple {6030#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6030#false} is VALID [2022-04-27 12:55:10,344 INFO L290 TraceCheckUtils]: 60: Hoare triple {6030#false} ~cond := #in~cond; {6030#false} is VALID [2022-04-27 12:55:10,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {6030#false} assume 0 == ~cond; {6030#false} is VALID [2022-04-27 12:55:10,344 INFO L290 TraceCheckUtils]: 62: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2022-04-27 12:55:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:55:10,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:10,589 INFO L290 TraceCheckUtils]: 62: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2022-04-27 12:55:10,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {6030#false} assume 0 == ~cond; {6030#false} is VALID [2022-04-27 12:55:10,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {6030#false} ~cond := #in~cond; {6030#false} is VALID [2022-04-27 12:55:10,589 INFO L272 TraceCheckUtils]: 59: Hoare triple {6030#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6030#false} is VALID [2022-04-27 12:55:10,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {6030#false} assume !(0 != ~b~0); {6030#false} is VALID [2022-04-27 12:55:10,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {6030#false} assume !!(#t~post6 < 5);havoc #t~post6; {6030#false} is VALID [2022-04-27 12:55:10,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {6030#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6030#false} is VALID [2022-04-27 12:55:10,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {6030#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; {6030#false} is VALID [2022-04-27 12:55:10,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {6248#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {6030#false} is VALID [2022-04-27 12:55:10,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {6252#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6248#(< |main_#t~post7| 5)} is VALID [2022-04-27 12:55:10,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {6252#(< ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,591 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6029#true} {6252#(< ~counter~0 5)} #92#return; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,591 INFO L272 TraceCheckUtils]: 47: Hoare triple {6252#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,592 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6029#true} {6252#(< ~counter~0 5)} #90#return; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,592 INFO L272 TraceCheckUtils]: 42: Hoare triple {6252#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,593 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6029#true} {6252#(< ~counter~0 5)} #88#return; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,593 INFO L272 TraceCheckUtils]: 37: Hoare triple {6252#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,593 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6029#true} {6252#(< ~counter~0 5)} #86#return; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,594 INFO L272 TraceCheckUtils]: 32: Hoare triple {6252#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {6252#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {6322#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6252#(< ~counter~0 5)} is VALID [2022-04-27 12:55:10,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {6322#(< ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6322#(< ~counter~0 4)} is VALID [2022-04-27 12:55:10,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {6322#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {6322#(< ~counter~0 4)} is VALID [2022-04-27 12:55:10,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {6126#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6322#(< ~counter~0 4)} is VALID [2022-04-27 12:55:10,596 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6029#true} {6126#(<= ~counter~0 2)} #84#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,596 INFO L272 TraceCheckUtils]: 22: Hoare triple {6126#(<= ~counter~0 2)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,596 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6029#true} {6126#(<= ~counter~0 2)} #82#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,597 INFO L272 TraceCheckUtils]: 17: Hoare triple {6126#(<= ~counter~0 2)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {6126#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6029#true} {6126#(<= ~counter~0 2)} #80#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L272 TraceCheckUtils]: 11: Hoare triple {6126#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6029#true} {6126#(<= ~counter~0 2)} #78#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {6029#true} assume true; {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {6029#true} assume !(0 == ~cond); {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {6126#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6029#true} is VALID [2022-04-27 12:55:10,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {6126#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {6126#(<= ~counter~0 2)} call #t~ret8 := main(); {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6126#(<= ~counter~0 2)} {6029#true} #98#return; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {6126#(<= ~counter~0 2)} assume true; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {6029#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; {6126#(<= ~counter~0 2)} is VALID [2022-04-27 12:55:10,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6029#true} is VALID [2022-04-27 12:55:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 12:55:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824471604] [2022-04-27 12:55:10,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856960198] [2022-04-27 12:55:10,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856960198] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:55:10,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:55:10,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 12:55:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108101146] [2022-04-27 12:55:10,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:10,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 63 [2022-04-27 12:55:10,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:10,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:10,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:55:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:55:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:55:10,663 INFO L87 Difference]: Start difference. First operand 189 states and 237 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:11,150 INFO L93 Difference]: Finished difference Result 269 states and 350 transitions. [2022-04-27 12:55:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:55:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 63 [2022-04-27 12:55:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2022-04-27 12:55:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2022-04-27 12:55:11,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 141 transitions. [2022-04-27 12:55:11,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:11,282 INFO L225 Difference]: With dead ends: 269 [2022-04-27 12:55:11,282 INFO L226 Difference]: Without dead ends: 197 [2022-04-27 12:55:11,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:55:11,284 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:11,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 228 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:55:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-27 12:55:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-27 12:55:11,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:11,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 128 states have (on average 1.1796875) internal successors, (151), 130 states have internal predecessors, (151), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:11,491 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 128 states have (on average 1.1796875) internal successors, (151), 130 states have internal predecessors, (151), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:11,491 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 128 states have (on average 1.1796875) internal successors, (151), 130 states have internal predecessors, (151), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:11,497 INFO L93 Difference]: Finished difference Result 197 states and 241 transitions. [2022-04-27 12:55:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2022-04-27 12:55:11,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:11,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:11,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 128 states have (on average 1.1796875) internal successors, (151), 130 states have internal predecessors, (151), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand 197 states. [2022-04-27 12:55:11,498 INFO L87 Difference]: Start difference. First operand has 195 states, 128 states have (on average 1.1796875) internal successors, (151), 130 states have internal predecessors, (151), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand 197 states. [2022-04-27 12:55:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:11,504 INFO L93 Difference]: Finished difference Result 197 states and 241 transitions. [2022-04-27 12:55:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2022-04-27 12:55:11,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:11,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:11,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:11,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 128 states have (on average 1.1796875) internal successors, (151), 130 states have internal predecessors, (151), 46 states have call successors, (46), 21 states have call predecessors, (46), 20 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:55:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 240 transitions. [2022-04-27 12:55:11,511 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 240 transitions. Word has length 63 [2022-04-27 12:55:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:11,511 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 240 transitions. [2022-04-27 12:55:11,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-27 12:55:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 240 transitions. [2022-04-27 12:55:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 12:55:11,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:11,512 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:11,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 12:55:11,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 12:55:11,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-27 12:55:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:11,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066334334] [2022-04-27 12:55:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:11,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [97697710] [2022-04-27 12:55:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:11,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:11,755 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:11,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 12:55:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:11,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 12:55:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:11,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:16,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {7489#true} call ULTIMATE.init(); {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {7489#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; {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7489#true} {7489#true} #98#return; {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {7489#true} call #t~ret8 := main(); {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {7489#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {7489#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7489#true} {7489#true} #78#return; {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {7489#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7489#true} {7489#true} #80#return; {7489#true} is VALID [2022-04-27 12:55:16,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {7489#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:55:16,202 INFO L272 TraceCheckUtils]: 17: Hoare triple {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,203 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7489#true} {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:55:16,203 INFO L272 TraceCheckUtils]: 22: Hoare triple {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,204 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7489#true} {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:55:16,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:55:16,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:55:16,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {7542#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,207 INFO L272 TraceCheckUtils]: 32: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,208 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7489#true} {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,208 INFO L272 TraceCheckUtils]: 37: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,209 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7489#true} {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,209 INFO L272 TraceCheckUtils]: 42: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {7489#true} ~cond := #in~cond; {7625#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:16,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {7625#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:16,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:16,211 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,211 INFO L272 TraceCheckUtils]: 47: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,212 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7489#true} {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:55:16,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {7582#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,215 INFO L272 TraceCheckUtils]: 59: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:16,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:16,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:16,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:16,216 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {7489#true} {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #86#return; {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 12:55:16,217 INFO L272 TraceCheckUtils]: 64: Hoare triple {7657#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:16,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {7691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:16,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {7695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7490#false} is VALID [2022-04-27 12:55:16,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {7490#false} assume !false; {7490#false} is VALID [2022-04-27 12:55:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 12:55:16,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:28,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {7490#false} assume !false; {7490#false} is VALID [2022-04-27 12:55:28,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {7695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7490#false} is VALID [2022-04-27 12:55:28,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {7691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:28,722 INFO L272 TraceCheckUtils]: 64: Hoare triple {7711#(= 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)); {7691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:28,723 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {7489#true} {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,723 INFO L272 TraceCheckUtils]: 59: Hoare triple {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {7745#(= 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; {7711#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:55:28,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {7745#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {7745#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:28,726 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7489#true} {7745#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {7745#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:28,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,727 INFO L272 TraceCheckUtils]: 47: Hoare triple {7745#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,727 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} {7489#true} #90#return; {7745#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:28,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:28,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {7776#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:28,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {7489#true} ~cond := #in~cond; {7776#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:55:28,728 INFO L272 TraceCheckUtils]: 42: Hoare triple {7489#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,728 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7489#true} {7489#true} #88#return; {7489#true} is VALID [2022-04-27 12:55:28,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L272 TraceCheckUtils]: 37: Hoare triple {7489#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7489#true} {7489#true} #86#return; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L272 TraceCheckUtils]: 32: Hoare triple {7489#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {7489#true} assume !!(#t~post7 < 5);havoc #t~post7; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {7489#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {7489#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {7489#true} assume !!(#t~post6 < 5);havoc #t~post6; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {7489#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7489#true} {7489#true} #84#return; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L272 TraceCheckUtils]: 22: Hoare triple {7489#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7489#true} {7489#true} #82#return; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L272 TraceCheckUtils]: 17: Hoare triple {7489#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {7489#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7489#true} {7489#true} #80#return; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {7489#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7489#true} {7489#true} #78#return; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {7489#true} assume !(0 == ~cond); {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {7489#true} ~cond := #in~cond; {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {7489#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {7489#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {7489#true} call #t~ret8 := main(); {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7489#true} {7489#true} #98#return; {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {7489#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; {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {7489#true} call ULTIMATE.init(); {7489#true} is VALID [2022-04-27 12:55:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 12:55:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:28,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066334334] [2022-04-27 12:55:28,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:28,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97697710] [2022-04-27 12:55:28,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97697710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:55:28,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:55:28,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 12:55:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443490393] [2022-04-27 12:55:28,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-27 12:55:28,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:28,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:28,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:55:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:55:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:55:28,789 INFO L87 Difference]: Start difference. First operand 195 states and 240 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:30,526 INFO L93 Difference]: Finished difference Result 272 states and 358 transitions. [2022-04-27 12:55:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 12:55:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-27 12:55:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-27 12:55:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-27 12:55:30,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-27 12:55:30,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:30,685 INFO L225 Difference]: With dead ends: 272 [2022-04-27 12:55:30,685 INFO L226 Difference]: Without dead ends: 267 [2022-04-27 12:55:30,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:55:30,686 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:55:30,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 319 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 12:55:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-27 12:55:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2022-04-27 12:55:30,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:55:30,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 237 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 23 states have call predecessors, (58), 22 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:55:30,891 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 237 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 23 states have call predecessors, (58), 22 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:55:30,892 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 237 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 23 states have call predecessors, (58), 22 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:55:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:30,900 INFO L93 Difference]: Finished difference Result 267 states and 349 transitions. [2022-04-27 12:55:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 349 transitions. [2022-04-27 12:55:30,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:30,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:30,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 23 states have call predecessors, (58), 22 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) Second operand 267 states. [2022-04-27 12:55:30,902 INFO L87 Difference]: Start difference. First operand has 237 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 23 states have call predecessors, (58), 22 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) Second operand 267 states. [2022-04-27 12:55:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:30,911 INFO L93 Difference]: Finished difference Result 267 states and 349 transitions. [2022-04-27 12:55:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 349 transitions. [2022-04-27 12:55:30,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:55:30,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:55:30,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:55:30,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:55:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 23 states have call predecessors, (58), 22 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:55:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 301 transitions. [2022-04-27 12:55:30,920 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 301 transitions. Word has length 68 [2022-04-27 12:55:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:55:30,920 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 301 transitions. [2022-04-27 12:55:30,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:55:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 301 transitions. [2022-04-27 12:55:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 12:55:30,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:55:30,921 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:55:30,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 12:55:31,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 12:55:31,136 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:55:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:55:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 2 times [2022-04-27 12:55:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:55:31,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572580095] [2022-04-27 12:55:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:55:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:55:31,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:55:31,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577050536] [2022-04-27 12:55:31,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:55:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:55:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:55:31,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:55:31,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 12:55:31,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:55:31,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:55:31,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 12:55:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:55:31,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:55:33,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {9206#true} call ULTIMATE.init(); {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {9206#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; {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9206#true} {9206#true} #98#return; {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {9206#true} call #t~ret8 := main(); {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {9206#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {9206#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,762 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9206#true} {9206#true} #78#return; {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L272 TraceCheckUtils]: 11: Hoare triple {9206#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9206#true} {9206#true} #80#return; {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {9206#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9206#true} {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,764 INFO L272 TraceCheckUtils]: 22: Hoare triple {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,765 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9206#true} {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {9259#(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; {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {9259#(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 < 5);havoc #t~post6; {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {9259#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {9299#(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; {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {9299#(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 < 5);havoc #t~post7; {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,767 INFO L272 TraceCheckUtils]: 32: Hoare triple {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,768 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9206#true} {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,768 INFO L272 TraceCheckUtils]: 37: Hoare triple {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,769 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9206#true} {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,769 INFO L272 TraceCheckUtils]: 42: Hoare triple {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {9206#true} ~cond := #in~cond; {9342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:33,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {9342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:33,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:33,771 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} {9299#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {9353#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,771 INFO L272 TraceCheckUtils]: 47: Hoare triple {9353#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,772 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {9206#true} {9353#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {9353#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {9353#(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); {9353#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:55:33,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {9353#(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; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,774 INFO L272 TraceCheckUtils]: 59: Hoare triple {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:33,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,775 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {9206#true} {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,775 INFO L272 TraceCheckUtils]: 64: Hoare triple {9375#(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)); {9206#true} is VALID [2022-04-27 12:55:33,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:33,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:33,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:33,776 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9206#true} {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {9375#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 12:55:33,776 INFO L272 TraceCheckUtils]: 69: Hoare triple {9375#(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)); {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:33,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:33,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {9428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9207#false} is VALID [2022-04-27 12:55:33,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {9207#false} assume !false; {9207#false} is VALID [2022-04-27 12:55:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 12:55:33,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:55:52,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {9207#false} assume !false; {9207#false} is VALID [2022-04-27 12:55:52,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {9428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9207#false} is VALID [2022-04-27 12:55:52,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:55:52,531 INFO L272 TraceCheckUtils]: 69: Hoare triple {9444#(= 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)); {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:55:52,532 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9206#true} {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:52,532 INFO L290 TraceCheckUtils]: 67: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:52,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:52,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:52,532 INFO L272 TraceCheckUtils]: 64: Hoare triple {9444#(= 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)); {9206#true} is VALID [2022-04-27 12:55:52,533 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {9206#true} {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:52,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:52,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:52,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:52,533 INFO L272 TraceCheckUtils]: 59: Hoare triple {9444#(= 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)); {9206#true} is VALID [2022-04-27 12:55:52,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:52,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:52,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:52,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:52,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:55:54,536 WARN L290 TraceCheckUtils]: 53: Hoare triple {9493#(= (+ (* (+ (* (* 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; {9444#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-27 12:55:54,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {9493#(= (+ (* (+ (* (* 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); {9493#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 12:55:54,538 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {9206#true} {9493#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #92#return; {9493#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 12:55:54,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,538 INFO L272 TraceCheckUtils]: 47: Hoare triple {9493#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,539 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #90#return; {9493#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 12:55:54,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:54,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {9525#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:55:54,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {9206#true} ~cond := #in~cond; {9525#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:55:54,540 INFO L272 TraceCheckUtils]: 42: Hoare triple {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,540 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9206#true} {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,541 INFO L272 TraceCheckUtils]: 37: Hoare triple {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,541 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9206#true} {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,543 INFO L272 TraceCheckUtils]: 32: Hoare triple {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {9515#(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 < 5);havoc #t~post7; {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {9515#(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; {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9515#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post6 < 5);havoc #t~post6; {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,551 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9206#true} {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #84#return; {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,551 INFO L272 TraceCheckUtils]: 22: Hoare triple {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,552 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9206#true} {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #82#return; {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,552 INFO L272 TraceCheckUtils]: 17: Hoare triple {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {9206#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9568#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:55:54,553 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9206#true} {9206#true} #80#return; {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L272 TraceCheckUtils]: 11: Hoare triple {9206#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9206#true} {9206#true} #78#return; {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {9206#true} assume !(0 == ~cond); {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {9206#true} ~cond := #in~cond; {9206#true} is VALID [2022-04-27 12:55:54,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {9206#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {9206#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {9206#true} call #t~ret8 := main(); {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9206#true} {9206#true} #98#return; {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {9206#true} assume true; {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {9206#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; {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {9206#true} call ULTIMATE.init(); {9206#true} is VALID [2022-04-27 12:55:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 12:55:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:55:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572580095] [2022-04-27 12:55:54,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:55:54,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577050536] [2022-04-27 12:55:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577050536] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:55:54,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:55:54,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-27 12:55:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362595443] [2022-04-27 12:55:54,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:55:54,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-27 12:55:54,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:55:54,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:54,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:55:54,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:55:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:55:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:55:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:55:54,917 INFO L87 Difference]: Start difference. First operand 237 states and 301 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:58,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:55:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:55:59,608 INFO L93 Difference]: Finished difference Result 256 states and 325 transitions. [2022-04-27 12:55:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:55:59,609 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-27 12:55:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:55:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-27 12:55:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:55:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-27 12:55:59,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-27 12:56:00,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:56:00,554 INFO L225 Difference]: With dead ends: 256 [2022-04-27 12:56:00,554 INFO L226 Difference]: Without dead ends: 253 [2022-04-27 12:56:00,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:56:00,555 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:56:00,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 280 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 12:56:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-27 12:56:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-04-27 12:56:00,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:56:00,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 243 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 56 states have call successors, (56), 25 states have call predecessors, (56), 24 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:56:00,744 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 243 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 56 states have call successors, (56), 25 states have call predecessors, (56), 24 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:56:00,745 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 243 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 56 states have call successors, (56), 25 states have call predecessors, (56), 24 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:56:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:00,752 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2022-04-27 12:56:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2022-04-27 12:56:00,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:56:00,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:56:00,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 56 states have call successors, (56), 25 states have call predecessors, (56), 24 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) Second operand 253 states. [2022-04-27 12:56:00,757 INFO L87 Difference]: Start difference. First operand has 243 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 56 states have call successors, (56), 25 states have call predecessors, (56), 24 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) Second operand 253 states. [2022-04-27 12:56:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:00,767 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2022-04-27 12:56:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2022-04-27 12:56:00,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:56:00,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:56:00,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:56:00,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:56:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 56 states have call successors, (56), 25 states have call predecessors, (56), 24 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 12:56:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 304 transitions. [2022-04-27 12:56:00,801 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 304 transitions. Word has length 73 [2022-04-27 12:56:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:56:00,801 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 304 transitions. [2022-04-27 12:56:00,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 12:56:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 304 transitions. [2022-04-27 12:56:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 12:56:00,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:56:00,803 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:56:00,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 12:56:01,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 12:56:01,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:56:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:56:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 3 times [2022-04-27 12:56:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:56:01,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984941314] [2022-04-27 12:56:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:56:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:56:01,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:56:01,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288002235] [2022-04-27 12:56:01,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:56:01,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:56:01,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:56:01,049 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:56:01,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 12:56:01,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 12:56:01,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:56:01,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 12:56:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:56:01,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:56:05,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {10906#true} call ULTIMATE.init(); {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {10906#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; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10906#true} {10906#true} #98#return; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {10906#true} call #t~ret8 := main(); {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {10906#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {10906#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10906#true} {10906#true} #78#return; {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L272 TraceCheckUtils]: 11: Hoare triple {10906#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10906#true} {10906#true} #80#return; {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {10906#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,733 INFO L272 TraceCheckUtils]: 17: Hoare triple {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,734 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10906#true} {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,734 INFO L272 TraceCheckUtils]: 22: Hoare triple {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,735 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10906#true} {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {10959#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,737 INFO L272 TraceCheckUtils]: 32: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,738 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10906#true} {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,738 INFO L272 TraceCheckUtils]: 37: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,739 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10906#true} {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,739 INFO L272 TraceCheckUtils]: 42: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,740 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10906#true} {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,740 INFO L272 TraceCheckUtils]: 47: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,741 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10906#true} {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:56:05,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,743 INFO L272 TraceCheckUtils]: 59: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,745 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10906#true} {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,745 INFO L272 TraceCheckUtils]: 64: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-27 12:56:05,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-27 12:56:05,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-27 12:56:05,746 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10906#true} {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,746 INFO L272 TraceCheckUtils]: 69: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10906#true} is VALID [2022-04-27 12:56:05,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {10906#true} ~cond := #in~cond; {11124#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:56:05,747 INFO L290 TraceCheckUtils]: 71: Hoare triple {11124#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11128#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:56:05,747 INFO L290 TraceCheckUtils]: 72: Hoare triple {11128#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11128#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:56:05,748 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11128#(not (= |__VERIFIER_assert_#in~cond| 0))} {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:56:05,749 INFO L272 TraceCheckUtils]: 74: Hoare triple {11072#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:56:05,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {11138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:56:05,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {11142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10907#false} is VALID [2022-04-27 12:56:05,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {10907#false} assume !false; {10907#false} is VALID [2022-04-27 12:56:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-27 12:56:05,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:56:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:56:57,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984941314] [2022-04-27 12:56:57,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:56:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288002235] [2022-04-27 12:56:57,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288002235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:56:57,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:56:57,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:56:57,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702848267] [2022-04-27 12:56:57,643 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:56:57,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-27 12:56:57,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:56:57,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:57,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:56:57,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:56:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:56:57,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:56:57,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:56:57,699 INFO L87 Difference]: Start difference. First operand 243 states and 304 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:58,693 INFO L93 Difference]: Finished difference Result 266 states and 331 transitions. [2022-04-27 12:56:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:56:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-27 12:56:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:56:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 12:56:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 12:56:58,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-27 12:56:58,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:56:58,792 INFO L225 Difference]: With dead ends: 266 [2022-04-27 12:56:58,792 INFO L226 Difference]: Without dead ends: 262 [2022-04-27 12:56:58,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:56:58,793 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:56:58,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 233 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:56:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-27 12:56:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2022-04-27 12:56:58,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:56:58,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 260 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 179 states have internal predecessors, (207), 60 states have call successors, (60), 28 states have call predecessors, (60), 26 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:56:58,995 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 260 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 179 states have internal predecessors, (207), 60 states have call successors, (60), 28 states have call predecessors, (60), 26 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:56:58,995 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 260 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 179 states have internal predecessors, (207), 60 states have call successors, (60), 28 states have call predecessors, (60), 26 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:56:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:59,002 INFO L93 Difference]: Finished difference Result 262 states and 326 transitions. [2022-04-27 12:56:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 326 transitions. [2022-04-27 12:56:59,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:56:59,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:56:59,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 179 states have internal predecessors, (207), 60 states have call successors, (60), 28 states have call predecessors, (60), 26 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) Second operand 262 states. [2022-04-27 12:56:59,004 INFO L87 Difference]: Start difference. First operand has 260 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 179 states have internal predecessors, (207), 60 states have call successors, (60), 28 states have call predecessors, (60), 26 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) Second operand 262 states. [2022-04-27 12:56:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:56:59,011 INFO L93 Difference]: Finished difference Result 262 states and 326 transitions. [2022-04-27 12:56:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 326 transitions. [2022-04-27 12:56:59,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:56:59,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:56:59,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:56:59,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:56:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 179 states have internal predecessors, (207), 60 states have call successors, (60), 28 states have call predecessors, (60), 26 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:56:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 324 transitions. [2022-04-27 12:56:59,020 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 324 transitions. Word has length 78 [2022-04-27 12:56:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:56:59,020 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 324 transitions. [2022-04-27 12:56:59,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:56:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 324 transitions. [2022-04-27 12:56:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 12:56:59,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:56:59,022 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:56:59,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 12:56:59,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 12:56:59,237 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:56:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:56:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-27 12:56:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:56:59,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355568948] [2022-04-27 12:56:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:56:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:56:59,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:56:59,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805712478] [2022-04-27 12:56:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:56:59,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:56:59,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:56:59,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:56:59,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 12:56:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:56:59,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 12:56:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:56:59,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:57:00,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {12457#true} call ULTIMATE.init(); {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {12457#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; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12457#true} {12457#true} #98#return; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {12457#true} call #t~ret8 := main(); {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {12457#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {12457#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12457#true} {12457#true} #78#return; {12457#true} is VALID [2022-04-27 12:57:00,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {12457#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12457#true} {12457#true} #80#return; {12457#true} is VALID [2022-04-27 12:57:00,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {12457#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,103 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12457#true} {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,104 INFO L272 TraceCheckUtils]: 22: Hoare triple {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,105 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12457#true} {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {12510#(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; {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {12510#(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 < 5);havoc #t~post6; {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {12510#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {12550#(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; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {12550#(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 < 5);havoc #t~post7; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,107 INFO L272 TraceCheckUtils]: 32: Hoare triple {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,108 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12457#true} {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,108 INFO L272 TraceCheckUtils]: 37: Hoare triple {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,109 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12457#true} {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,110 INFO L272 TraceCheckUtils]: 42: Hoare triple {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,111 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12457#true} {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,111 INFO L272 TraceCheckUtils]: 47: Hoare triple {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,112 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12457#true} {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {12550#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,114 INFO L272 TraceCheckUtils]: 55: Hoare triple {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,115 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12457#true} {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,115 INFO L272 TraceCheckUtils]: 60: Hoare triple {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {12457#true} ~cond := #in~cond; {12648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:57:00,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {12648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:00,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:00,118 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} {12620#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,118 INFO L272 TraceCheckUtils]: 65: Hoare triple {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,119 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {12457#true} {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,119 INFO L272 TraceCheckUtils]: 70: Hoare triple {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:00,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:00,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:00,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:00,120 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12457#true} {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:57:00,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {12659#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12696#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 12:57:00,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {12696#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12696#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 12:57:00,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {12696#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {12696#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 12:57:00,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {12696#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {12706#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 12:57:00,123 INFO L272 TraceCheckUtils]: 80: Hoare triple {12706#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {12710#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:57:00,124 INFO L290 TraceCheckUtils]: 81: Hoare triple {12710#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12714#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:57:00,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {12714#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12458#false} is VALID [2022-04-27 12:57:00,124 INFO L290 TraceCheckUtils]: 83: Hoare triple {12458#false} assume !false; {12458#false} is VALID [2022-04-27 12:57:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-27 12:57:00,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:57:45,128 INFO L290 TraceCheckUtils]: 83: Hoare triple {12458#false} assume !false; {12458#false} is VALID [2022-04-27 12:57:45,129 INFO L290 TraceCheckUtils]: 82: Hoare triple {12714#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12458#false} is VALID [2022-04-27 12:57:45,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {12710#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12714#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:57:45,133 INFO L272 TraceCheckUtils]: 80: Hoare triple {12730#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {12710#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:57:45,133 INFO L290 TraceCheckUtils]: 79: Hoare triple {12734#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {12730#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-27 12:57:45,134 INFO L290 TraceCheckUtils]: 78: Hoare triple {12734#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {12734#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 12:57:45,134 INFO L290 TraceCheckUtils]: 77: Hoare triple {12734#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12734#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 12:57:47,136 WARN L290 TraceCheckUtils]: 76: Hoare triple {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12734#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-27 12:57:47,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,137 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12457#true} {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #92#return; {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,137 INFO L272 TraceCheckUtils]: 70: Hoare triple {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,139 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {12457#true} {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,140 INFO L272 TraceCheckUtils]: 65: Hoare triple {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,141 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {12744#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:47,141 INFO L290 TraceCheckUtils]: 62: Hoare triple {12791#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:57:47,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {12457#true} ~cond := #in~cond; {12791#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:57:47,142 INFO L272 TraceCheckUtils]: 60: Hoare triple {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,142 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12457#true} {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,143 INFO L272 TraceCheckUtils]: 55: Hoare triple {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !!(#t~post7 < 5);havoc #t~post7; {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {12781#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 12:57:47,289 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12457#true} {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #92#return; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,289 INFO L290 TraceCheckUtils]: 50: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,289 INFO L290 TraceCheckUtils]: 49: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,289 INFO L272 TraceCheckUtils]: 47: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,290 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12457#true} {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #90#return; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,290 INFO L272 TraceCheckUtils]: 42: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,291 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12457#true} {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #88#return; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,291 INFO L272 TraceCheckUtils]: 37: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,292 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12457#true} {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #86#return; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,292 INFO L272 TraceCheckUtils]: 32: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 5);havoc #t~post7; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12819#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 12:57:47,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:47,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:47,295 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12457#true} {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #84#return; {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:47,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,296 INFO L272 TraceCheckUtils]: 22: Hoare triple {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,296 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12457#true} {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #82#return; {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:47,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L272 TraceCheckUtils]: 17: Hoare triple {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {12457#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12889#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:57:47,297 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12457#true} {12457#true} #80#return; {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L272 TraceCheckUtils]: 11: Hoare triple {12457#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12457#true} {12457#true} #78#return; {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {12457#true} assume !(0 == ~cond); {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {12457#true} ~cond := #in~cond; {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {12457#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {12457#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {12457#true} call #t~ret8 := main(); {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12457#true} {12457#true} #98#return; {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {12457#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; {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {12457#true} call ULTIMATE.init(); {12457#true} is VALID [2022-04-27 12:57:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-27 12:57:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:57:47,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355568948] [2022-04-27 12:57:47,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:57:47,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805712478] [2022-04-27 12:57:47,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805712478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:57:47,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:57:47,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-27 12:57:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671403046] [2022-04-27 12:57:47,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:57:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-27 12:57:47,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:57:47,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:48,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:57:48,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 12:57:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:57:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 12:57:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:57:48,378 INFO L87 Difference]: Start difference. First operand 260 states and 324 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:57:56,392 INFO L93 Difference]: Finished difference Result 327 states and 422 transitions. [2022-04-27 12:57:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 12:57:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-27 12:57:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:57:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-27 12:57:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-27 12:57:56,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 173 transitions. [2022-04-27 12:57:59,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:57:59,580 INFO L225 Difference]: With dead ends: 327 [2022-04-27 12:57:59,580 INFO L226 Difference]: Without dead ends: 317 [2022-04-27 12:57:59,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 12:57:59,581 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 87 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:57:59,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 417 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-27 12:57:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-27 12:57:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2022-04-27 12:57:59,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:57:59,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 301 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 76 states have call successors, (76), 28 states have call predecessors, (76), 27 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 12:57:59,843 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 301 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 76 states have call successors, (76), 28 states have call predecessors, (76), 27 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 12:57:59,843 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 301 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 76 states have call successors, (76), 28 states have call predecessors, (76), 27 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 12:57:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:57:59,853 INFO L93 Difference]: Finished difference Result 317 states and 409 transitions. [2022-04-27 12:57:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 409 transitions. [2022-04-27 12:57:59,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:57:59,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:57:59,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 76 states have call successors, (76), 28 states have call predecessors, (76), 27 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 317 states. [2022-04-27 12:57:59,855 INFO L87 Difference]: Start difference. First operand has 301 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 76 states have call successors, (76), 28 states have call predecessors, (76), 27 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 317 states. [2022-04-27 12:57:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:57:59,865 INFO L93 Difference]: Finished difference Result 317 states and 409 transitions. [2022-04-27 12:57:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 409 transitions. [2022-04-27 12:57:59,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:57:59,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:57:59,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:57:59,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:57:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 76 states have call successors, (76), 28 states have call predecessors, (76), 27 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 12:57:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 391 transitions. [2022-04-27 12:57:59,876 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 391 transitions. Word has length 84 [2022-04-27 12:57:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:57:59,877 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 391 transitions. [2022-04-27 12:57:59,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 12:57:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 391 transitions. [2022-04-27 12:57:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 12:57:59,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:57:59,879 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:57:59,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 12:58:00,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:58:00,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:58:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:58:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash 325787368, now seen corresponding path program 1 times [2022-04-27 12:58:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:58:00,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6931875] [2022-04-27 12:58:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:58:00,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:58:00,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599388713] [2022-04-27 12:58:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:00,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:58:00,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:58:00,108 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:58:00,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 12:58:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:00,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:58:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:00,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:58:00,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {14567#true} call ULTIMATE.init(); {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {14567#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; {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14567#true} {14567#true} #98#return; {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {14567#true} call #t~ret8 := main(); {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {14567#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {14567#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14567#true} {14567#true} #78#return; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {14567#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14567#true} {14567#true} #80#return; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {14567#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L272 TraceCheckUtils]: 17: Hoare triple {14567#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14567#true} {14567#true} #82#return; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L272 TraceCheckUtils]: 22: Hoare triple {14567#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14567#true} {14567#true} #84#return; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {14567#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {14567#true} assume !!(#t~post6 < 5);havoc #t~post6; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {14567#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {14567#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {14567#true} assume !!(#t~post7 < 5);havoc #t~post7; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L272 TraceCheckUtils]: 32: Hoare triple {14567#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14567#true} {14567#true} #86#return; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L272 TraceCheckUtils]: 37: Hoare triple {14567#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,409 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14567#true} {14567#true} #88#return; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L272 TraceCheckUtils]: 42: Hoare triple {14567#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14567#true} {14567#true} #90#return; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L272 TraceCheckUtils]: 47: Hoare triple {14567#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14567#true} {14567#true} #92#return; {14567#true} is VALID [2022-04-27 12:58:00,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {14567#true} assume !(~c~0 >= ~b~0); {14728#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 12:58:00,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {14728#(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; {14732#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:58:00,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {14732#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14732#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:58:00,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {14732#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {14732#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:58:00,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {14732#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {14742#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {14742#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,412 INFO L272 TraceCheckUtils]: 59: Hoare triple {14742#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,412 INFO L290 TraceCheckUtils]: 61: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,413 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14567#true} {14742#(< main_~b~0 main_~c~0)} #86#return; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,413 INFO L272 TraceCheckUtils]: 64: Hoare triple {14742#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,414 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14567#true} {14742#(< main_~b~0 main_~c~0)} #88#return; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,414 INFO L272 TraceCheckUtils]: 69: Hoare triple {14742#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,414 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14567#true} {14742#(< main_~b~0 main_~c~0)} #90#return; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,414 INFO L272 TraceCheckUtils]: 74: Hoare triple {14742#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14567#true} is VALID [2022-04-27 12:58:00,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {14567#true} ~cond := #in~cond; {14567#true} is VALID [2022-04-27 12:58:00,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {14567#true} assume !(0 == ~cond); {14567#true} is VALID [2022-04-27 12:58:00,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {14567#true} assume true; {14567#true} is VALID [2022-04-27 12:58:00,415 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14567#true} {14742#(< main_~b~0 main_~c~0)} #92#return; {14742#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {14742#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {14568#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; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {14568#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 82: Hoare triple {14568#false} assume !!(#t~post6 < 5);havoc #t~post6; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {14568#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {14568#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {14568#false} assume !(#t~post7 < 5);havoc #t~post7; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {14568#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; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {14568#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {14568#false} assume !(#t~post6 < 5);havoc #t~post6; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L272 TraceCheckUtils]: 89: Hoare triple {14568#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {14568#false} ~cond := #in~cond; {14568#false} is VALID [2022-04-27 12:58:00,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {14568#false} assume 0 == ~cond; {14568#false} is VALID [2022-04-27 12:58:00,417 INFO L290 TraceCheckUtils]: 92: Hoare triple {14568#false} assume !false; {14568#false} is VALID [2022-04-27 12:58:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-27 12:58:00,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:58:00,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:58:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6931875] [2022-04-27 12:58:00,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:58:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599388713] [2022-04-27 12:58:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599388713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:58:00,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:58:00,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:58:00,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697433078] [2022-04-27 12:58:00,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:58:00,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2022-04-27 12:58:00,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:58:00,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 12:58:00,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:58:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:58:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:58:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:58:00,463 INFO L87 Difference]: Start difference. First operand 301 states and 391 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 12:58:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:01,144 INFO L93 Difference]: Finished difference Result 470 states and 653 transitions. [2022-04-27 12:58:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:58:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2022-04-27 12:58:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:58:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 12:58:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 12:58:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 12:58:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 12:58:01,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-27 12:58:01,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:01,250 INFO L225 Difference]: With dead ends: 470 [2022-04-27 12:58:01,250 INFO L226 Difference]: Without dead ends: 358 [2022-04-27 12:58:01,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:58:01,251 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:58:01,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:58:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-27 12:58:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 327. [2022-04-27 12:58:01,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:58:01,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 327 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 217 states have internal predecessors, (262), 86 states have call successors, (86), 28 states have call predecessors, (86), 27 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:58:01,598 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 327 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 217 states have internal predecessors, (262), 86 states have call successors, (86), 28 states have call predecessors, (86), 27 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:58:01,599 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 327 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 217 states have internal predecessors, (262), 86 states have call successors, (86), 28 states have call predecessors, (86), 27 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:58:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:01,609 INFO L93 Difference]: Finished difference Result 358 states and 481 transitions. [2022-04-27 12:58:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 481 transitions. [2022-04-27 12:58:01,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:01,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:01,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 217 states have internal predecessors, (262), 86 states have call successors, (86), 28 states have call predecessors, (86), 27 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) Second operand 358 states. [2022-04-27 12:58:01,612 INFO L87 Difference]: Start difference. First operand has 327 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 217 states have internal predecessors, (262), 86 states have call successors, (86), 28 states have call predecessors, (86), 27 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) Second operand 358 states. [2022-04-27 12:58:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:58:01,622 INFO L93 Difference]: Finished difference Result 358 states and 481 transitions. [2022-04-27 12:58:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 481 transitions. [2022-04-27 12:58:01,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:58:01,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:58:01,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:58:01,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:58:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 217 states have internal predecessors, (262), 86 states have call successors, (86), 28 states have call predecessors, (86), 27 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:58:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 432 transitions. [2022-04-27 12:58:01,634 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 432 transitions. Word has length 93 [2022-04-27 12:58:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:58:01,634 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 432 transitions. [2022-04-27 12:58:01,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-27 12:58:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 432 transitions. [2022-04-27 12:58:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 12:58:01,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:58:01,636 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:58:01,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 12:58:01,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 12:58:01,858 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:58:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:58:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-27 12:58:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:58:01,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409008810] [2022-04-27 12:58:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:58:01,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:58:01,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232658131] [2022-04-27 12:58:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:58:01,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:58:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:58:01,871 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:58:01,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 12:58:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:01,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 12:58:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:58:01,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:58:11,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {16746#true} call ULTIMATE.init(); {16746#true} is VALID [2022-04-27 12:58:11,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {16746#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; {16746#true} is VALID [2022-04-27 12:58:11,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16746#true} {16746#true} #98#return; {16746#true} is VALID [2022-04-27 12:58:11,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {16746#true} call #t~ret8 := main(); {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {16746#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {16746#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16746#true} {16746#true} #78#return; {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {16746#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16746#true} {16746#true} #80#return; {16746#true} is VALID [2022-04-27 12:58:11,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {16746#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:58:11,296 INFO L272 TraceCheckUtils]: 17: Hoare triple {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,296 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16746#true} {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:58:11,296 INFO L272 TraceCheckUtils]: 22: Hoare triple {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,297 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16746#true} {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:58:11,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:58:11,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 12:58:11,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {16799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,299 INFO L272 TraceCheckUtils]: 32: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,300 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16746#true} {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #86#return; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,300 INFO L272 TraceCheckUtils]: 37: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,301 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16746#true} {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #88#return; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,301 INFO L272 TraceCheckUtils]: 42: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,302 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16746#true} {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #90#return; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,302 INFO L272 TraceCheckUtils]: 47: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,303 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16746#true} {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #92#return; {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 12:58:11,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {16839#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,305 INFO L272 TraceCheckUtils]: 55: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,308 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16746#true} {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,308 INFO L272 TraceCheckUtils]: 60: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,309 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16746#true} {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,309 INFO L272 TraceCheckUtils]: 65: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,310 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16746#true} {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,310 INFO L272 TraceCheckUtils]: 70: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,310 INFO L290 TraceCheckUtils]: 71: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,310 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16746#true} {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {16909#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,313 INFO L290 TraceCheckUtils]: 78: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,313 INFO L290 TraceCheckUtils]: 79: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,314 INFO L290 TraceCheckUtils]: 81: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,314 INFO L272 TraceCheckUtils]: 82: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,314 INFO L290 TraceCheckUtils]: 83: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,314 INFO L290 TraceCheckUtils]: 84: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,314 INFO L290 TraceCheckUtils]: 85: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,315 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16746#true} {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,315 INFO L272 TraceCheckUtils]: 87: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,315 INFO L290 TraceCheckUtils]: 88: Hoare triple {16746#true} ~cond := #in~cond; {16746#true} is VALID [2022-04-27 12:58:11,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {16746#true} assume !(0 == ~cond); {16746#true} is VALID [2022-04-27 12:58:11,315 INFO L290 TraceCheckUtils]: 90: Hoare triple {16746#true} assume true; {16746#true} is VALID [2022-04-27 12:58:11,316 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16746#true} {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,316 INFO L272 TraceCheckUtils]: 92: Hoare triple {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16746#true} is VALID [2022-04-27 12:58:11,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {16746#true} ~cond := #in~cond; {17034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:11,316 INFO L290 TraceCheckUtils]: 94: Hoare triple {17034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:11,317 INFO L290 TraceCheckUtils]: 95: Hoare triple {17038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:58:11,317 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17038#(not (= |__VERIFIER_assert_#in~cond| 0))} {16982#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {17045#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 12:58:11,331 INFO L272 TraceCheckUtils]: 97: Hoare triple {17045#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17049#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:58:11,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {17049#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17053#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:58:11,332 INFO L290 TraceCheckUtils]: 99: Hoare triple {17053#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16747#false} is VALID [2022-04-27 12:58:11,332 INFO L290 TraceCheckUtils]: 100: Hoare triple {16747#false} assume !false; {16747#false} is VALID [2022-04-27 12:58:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-27 12:58:11,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:58:58,927 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:58:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:58:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409008810] [2022-04-27 12:58:59,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:58:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232658131] [2022-04-27 12:58:59,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232658131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:58:59,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:58:59,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 12:58:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176149275] [2022-04-27 12:58:59,459 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:58:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-27 12:58:59,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:58:59,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:58:59,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:58:59,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 12:58:59,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:58:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 12:58:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:58:59,577 INFO L87 Difference]: Start difference. First operand 327 states and 432 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:59:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:09,365 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-27 12:59:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:59:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-27 12:59:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:59:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-27 12:59:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:59:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-27 12:59:09,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 116 transitions. [2022-04-27 12:59:09,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:09,573 INFO L225 Difference]: With dead ends: 339 [2022-04-27 12:59:09,573 INFO L226 Difference]: Without dead ends: 337 [2022-04-27 12:59:09,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:59:09,574 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:09,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 281 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 12:59:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-27 12:59:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-27 12:59:09,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:09,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 335 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 223 states have internal predecessors, (268), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:59:09,908 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 335 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 223 states have internal predecessors, (268), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:59:09,908 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 335 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 223 states have internal predecessors, (268), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:59:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:09,918 INFO L93 Difference]: Finished difference Result 337 states and 440 transitions. [2022-04-27 12:59:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 440 transitions. [2022-04-27 12:59:09,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:09,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:09,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 223 states have internal predecessors, (268), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) Second operand 337 states. [2022-04-27 12:59:09,921 INFO L87 Difference]: Start difference. First operand has 335 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 223 states have internal predecessors, (268), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) Second operand 337 states. [2022-04-27 12:59:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:09,929 INFO L93 Difference]: Finished difference Result 337 states and 440 transitions. [2022-04-27 12:59:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 440 transitions. [2022-04-27 12:59:09,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:09,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:09,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:09,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 223 states have internal predecessors, (268), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-27 12:59:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 438 transitions. [2022-04-27 12:59:09,941 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 438 transitions. Word has length 101 [2022-04-27 12:59:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:09,941 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 438 transitions. [2022-04-27 12:59:09,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:59:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 438 transitions. [2022-04-27 12:59:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 12:59:09,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:09,943 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:09,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 12:59:10,157 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 1 times [2022-04-27 12:59:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:10,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260895569] [2022-04-27 12:59:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:10,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:10,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128783618] [2022-04-27 12:59:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:10,172 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:10,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 12:59:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:59:10,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 12:59:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:59:10,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 12:59:10,317 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 12:59:10,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:59:10,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 12:59:10,558 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:10,561 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:59:10,613 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:59:10,613 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 12:59:10,613 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:59:10,613 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:59:10,613 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:59:10,614 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 12:59:10,615 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 12:59:10,616 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 12:59:10,617 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 12:59:10,617 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 12:59:10,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:59:10 BoogieIcfgContainer [2022-04-27 12:59:10,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:59:10,619 INFO L158 Benchmark]: Toolchain (without parser) took 302303.96ms. Allocated memory was 178.3MB in the beginning and 242.2MB in the end (delta: 64.0MB). Free memory was 127.5MB in the beginning and 78.7MB in the end (delta: 48.8MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. [2022-04-27 12:59:10,619 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 178.3MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:59:10,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.58ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 151.6MB in the end (delta: -24.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 12:59:10,619 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 178.3MB. Free memory was 151.6MB in the beginning and 149.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 12:59:10,620 INFO L158 Benchmark]: RCFGBuilder took 343.50ms. Allocated memory is still 178.3MB. Free memory was 149.8MB in the beginning and 136.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:59:10,620 INFO L158 Benchmark]: TraceAbstraction took 301707.49ms. Allocated memory was 178.3MB in the beginning and 242.2MB in the end (delta: 64.0MB). Free memory was 136.1MB in the beginning and 78.7MB in the end (delta: 57.4MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2022-04-27 12:59:10,621 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.42ms. Allocated memory is still 178.3MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.58ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 151.6MB in the end (delta: -24.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 178.3MB. Free memory was 151.6MB in the beginning and 149.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.50ms. Allocated memory is still 178.3MB. Free memory was 149.8MB in the beginning and 136.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 301707.49ms. Allocated memory was 178.3MB in the beginning and 242.2MB in the end (delta: 64.0MB). Free memory was 136.1MB in the beginning and 78.7MB in the end (delta: 57.4MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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)=9, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [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=3, y=4] [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=3, y=4] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=3, b=4, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=3, b=4, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=3, b=4, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=4, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L40] COND TRUE counter++<5 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=3, b=4, c=3, counter=1, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=4, c=3, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=4, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=4, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=4, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=4, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=4, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, xy=12, y=4, yy=16] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=4, b=3, c=3, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L40] EXPR counter++ VAL [\old(counter)=0, a=4, b=3, c=3, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L40] COND TRUE counter++<5 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=4, b=3, c=4, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L46] EXPR counter++ VAL [\old(counter)=0, a=4, b=3, c=4, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4, b=3, c=4, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4, b=3, c=4, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4, b=3, c=4, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4, b=3, c=4, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=4, b=3, c=1, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L46] EXPR counter++ VAL [\old(counter)=0, a=4, b=3, c=1, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L46] COND TRUE counter++<5 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4, b=3, c=1, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4, b=3, c=1, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4, b=3, c=1, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4, b=3, c=1, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4, b=3, c=1, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=3, xy=12, y=4, yy=16] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=3, b=1, c=1, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=3, xy=12, y=4, yy=16] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=1, c=1, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=3, xy=12, y=4, yy=16] [L40] COND FALSE !(counter++<5) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 301.6s, OverallIterations: 18, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 3474 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2663 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2994 IncrementalHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 811 mSDtfsCounter, 2994 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1631 GetRequests, 1427 SyntacticMatches, 13 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=17, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 133 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 254.6s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1083 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 6381 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3006 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 1781/1978 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 12:59:10,673 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...