/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/egcd2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:15:54,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:15:54,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:15:54,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:15:54,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:15:54,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:15:54,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:15:54,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:15:54,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:15:54,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:15:54,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:15:54,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:15:54,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:15:54,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:15:54,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:15:54,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:15:54,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:15:54,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:15:54,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:15:54,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:15:54,459 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:15:54,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:15:54,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:15:54,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:15:54,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:15:54,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:15:54,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:15:54,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:15:54,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:15:54,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:15:54,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:15:54,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:15:54,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:15:54,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:15:54,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:15:54,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:15:54,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:15:54,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:15:54,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:15:54,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:15:54,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:15:54,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:15:54,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:15:54,482 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:15:54,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:15:54,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:15:54,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:15:54,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:15:54,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:15:54,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:15:54,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:15:54,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:15:54,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:15:54,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:15:54,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:15:54,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:15:54,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:15:54,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:15:54,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:15:54,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:15:54,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:15:54,487 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:15:54,488 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:15:54,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:15:54,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:15:54,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:15:54,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:15:54,739 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:15:54,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd2-ll.c [2022-04-15 07:15:54,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49c87ecc/079b714d729c4356a0fc7f86795fd2e3/FLAG179e7b080 [2022-04-15 07:15:55,185 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:15:55,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd2-ll.c [2022-04-15 07:15:55,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49c87ecc/079b714d729c4356a0fc7f86795fd2e3/FLAG179e7b080 [2022-04-15 07:15:55,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49c87ecc/079b714d729c4356a0fc7f86795fd2e3 [2022-04-15 07:15:55,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:15:55,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:15:55,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:15:55,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:15:55,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:15:55,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5acac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55, skipping insertion in model container [2022-04-15 07:15:55,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:15:55,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:15:55,387 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/egcd2-ll.c[490,503] [2022-04-15 07:15:55,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:15:55,446 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:15:55,459 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/egcd2-ll.c[490,503] [2022-04-15 07:15:55,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:15:55,494 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:15:55,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55 WrapperNode [2022-04-15 07:15:55,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:15:55,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:15:55,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:15:55,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:15:55,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:15:55,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:15:55,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:15:55,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:15:55,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (1/1) ... [2022-04-15 07:15:55,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:15:55,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:15:55,581 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-15 07:15:55,605 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-15 07:15:55,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:15:55,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:15:55,626 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:15:55,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:15:55,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:15:55,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:15:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:15:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:15:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:15:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:15:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:15:55,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:15:55,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:15:55,693 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:15:55,694 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:15:55,919 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:15:55,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:15:55,926 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:15:55,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:15:55 BoogieIcfgContainer [2022-04-15 07:15:55,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:15:55,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:15:55,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:15:55,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:15:55,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:15:55" (1/3) ... [2022-04-15 07:15:55,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6d905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:15:55, skipping insertion in model container [2022-04-15 07:15:55,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:15:55" (2/3) ... [2022-04-15 07:15:55,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6d905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:15:55, skipping insertion in model container [2022-04-15 07:15:55,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:15:55" (3/3) ... [2022-04-15 07:15:55,940 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll.c [2022-04-15 07:15:55,945 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:15:55,945 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:15:55,975 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:15:55,981 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:15:55,981 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:15:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 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-15 07:15:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:15:56,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:56,008 INFO L499 BasicCegarLoop]: 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-15 07:15:56,009 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1872307417, now seen corresponding path program 1 times [2022-04-15 07:15:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:56,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045194496] [2022-04-15 07:15:56,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:15:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1872307417, now seen corresponding path program 2 times [2022-04-15 07:15:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:56,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470058237] [2022-04-15 07:15:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#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); {40#true} is VALID [2022-04-15 07:15:56,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 07:15:56,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 07:15:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:15:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #76#return; {41#false} is VALID [2022-04-15 07:15:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:15:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #78#return; {41#false} is VALID [2022-04-15 07:15:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 07:15:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #80#return; {41#false} is VALID [2022-04-15 07:15:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 07:15:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #82#return; {41#false} is VALID [2022-04-15 07:15:56,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:56,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#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); {40#true} is VALID [2022-04-15 07:15:56,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 07:15:56,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 07:15:56,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-15 07:15:56,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-15 07:15:56,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 07:15:56,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #76#return; {41#false} is VALID [2022-04-15 07:15:56,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 07:15:56,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #78#return; {41#false} is VALID [2022-04-15 07:15:56,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#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; {41#false} is VALID [2022-04-15 07:15:56,306 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {40#true} is VALID [2022-04-15 07:15:56,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,309 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #80#return; {41#false} is VALID [2022-04-15 07:15:56,309 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {40#true} is VALID [2022-04-15 07:15:56,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 07:15:56,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 07:15:56,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 07:15:56,312 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #82#return; {41#false} is VALID [2022-04-15 07:15:56,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 07:15:56,317 INFO L272 TraceCheckUtils]: 28: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41#false} is VALID [2022-04-15 07:15:56,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 07:15:56,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 07:15:56,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 07:15:56,318 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-15 07:15:56,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:56,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470058237] [2022-04-15 07:15:56,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470058237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:56,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:56,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:15:56,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:56,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045194496] [2022-04-15 07:15:56,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045194496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:56,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:15:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543145337] [2022-04-15 07:15:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:56,327 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-15 07:15:56,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:56,334 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-15 07:15:56,368 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-15 07:15:56,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:15:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:56,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:15:56,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:15:56,399 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 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-15 07:15:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:56,554 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2022-04-15 07:15:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:15:56,554 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-15 07:15:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:56,555 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-15 07:15:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-15 07:15:56,584 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-15 07:15:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-15 07:15:56,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-04-15 07:15:56,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:56,769 INFO L225 Difference]: With dead ends: 67 [2022-04-15 07:15:56,769 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 07:15:56,771 INFO L912 BasicCegarLoop]: 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-15 07:15:56,774 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:56,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:15:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 07:15:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 07:15:56,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:56,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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-15 07:15:56,828 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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-15 07:15:56,828 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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-15 07:15:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:56,834 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 07:15:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 07:15:56,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:56,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:56,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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 32 states. [2022-04-15 07:15:56,836 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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 32 states. [2022-04-15 07:15:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:56,844 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 07:15:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 07:15:56,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:56,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:56,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:56,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 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-15 07:15:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 07:15:56,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 32 [2022-04-15 07:15:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:56,874 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 07:15:56,875 INFO L479 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-15 07:15:56,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 07:15:56,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 07:15:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 07:15:56,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:56,955 INFO L499 BasicCegarLoop]: 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-15 07:15:56,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:15:56,956 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 310247117, now seen corresponding path program 1 times [2022-04-15 07:15:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:56,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672879043] [2022-04-15 07:15:56,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:15:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 310247117, now seen corresponding path program 2 times [2022-04-15 07:15:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:56,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060665369] [2022-04-15 07:15:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:57,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:15:57,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015162585] [2022-04-15 07:15:57,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:15:57,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:57,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:15:57,015 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-15 07:15:57,052 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-15 07:15:57,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:15:57,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:15:57,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:15:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:57,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:15:57,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-15 07:15:57,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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); {326#true} is VALID [2022-04-15 07:15:57,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #96#return; {326#true} is VALID [2022-04-15 07:15:57,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-15 07:15:57,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#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; {326#true} is VALID [2022-04-15 07:15:57,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 07:15:57,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 07:15:57,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #76#return; {326#true} is VALID [2022-04-15 07:15:57,341 INFO L272 TraceCheckUtils]: 11: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#true} ~cond := #in~cond; {367#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:15:57,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {367#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {371#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:15:57,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {371#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {371#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:15:57,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {371#(not (= |assume_abort_if_not_#in~cond| 0))} {326#true} #78#return; {378#(<= 1 main_~y~0)} is VALID [2022-04-15 07:15:57,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {378#(<= 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; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,344 INFO L272 TraceCheckUtils]: 17: Hoare triple {382#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 07:15:57,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 07:15:57,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,345 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {382#(<= 1 main_~b~0)} #80#return; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,346 INFO L272 TraceCheckUtils]: 22: Hoare triple {382#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 07:15:57,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 07:15:57,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,347 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {382#(<= 1 main_~b~0)} #82#return; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {382#(<= 1 main_~b~0)} assume !false; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {382#(<= 1 main_~b~0)} assume !(0 != ~b~0); {327#false} is VALID [2022-04-15 07:15:57,348 INFO L272 TraceCheckUtils]: 29: Hoare triple {327#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {327#false} is VALID [2022-04-15 07:15:57,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2022-04-15 07:15:57,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2022-04-15 07:15:57,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-15 07:15:57,349 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-15 07:15:57,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:15:57,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-15 07:15:57,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2022-04-15 07:15:57,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2022-04-15 07:15:57,616 INFO L272 TraceCheckUtils]: 29: Hoare triple {327#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {327#false} is VALID [2022-04-15 07:15:57,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {382#(<= 1 main_~b~0)} assume !(0 != ~b~0); {327#false} is VALID [2022-04-15 07:15:57,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {382#(<= 1 main_~b~0)} assume !false; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,617 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {382#(<= 1 main_~b~0)} #82#return; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 07:15:57,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 07:15:57,619 INFO L272 TraceCheckUtils]: 22: Hoare triple {382#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,619 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {382#(<= 1 main_~b~0)} #80#return; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 07:15:57,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 07:15:57,620 INFO L272 TraceCheckUtils]: 17: Hoare triple {382#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {378#(<= 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; {382#(<= 1 main_~b~0)} is VALID [2022-04-15 07:15:57,624 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {371#(not (= |assume_abort_if_not_#in~cond| 0))} {326#true} #78#return; {378#(<= 1 main_~y~0)} is VALID [2022-04-15 07:15:57,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {371#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {371#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:15:57,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {371#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:15:57,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#true} ~cond := #in~cond; {491#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 07:15:57,633 INFO L272 TraceCheckUtils]: 11: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #76#return; {326#true} is VALID [2022-04-15 07:15:57,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-15 07:15:57,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-15 07:15:57,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-15 07:15:57,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#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; {326#true} is VALID [2022-04-15 07:15:57,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-15 07:15:57,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #96#return; {326#true} is VALID [2022-04-15 07:15:57,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 07:15:57,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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); {326#true} is VALID [2022-04-15 07:15:57,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-15 07:15:57,645 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-15 07:15:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:57,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060665369] [2022-04-15 07:15:57,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:15:57,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015162585] [2022-04-15 07:15:57,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015162585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:15:57,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:15:57,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 07:15:57,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672879043] [2022-04-15 07:15:57,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672879043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:57,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:57,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:15:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562060587] [2022-04-15 07:15:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 33 [2022-04-15 07:15:57,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:57,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-15 07:15:57,670 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-15 07:15:57,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:15:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:15:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:15:57,671 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-15 07:15:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:57,983 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-15 07:15:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:15:57,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 33 [2022-04-15 07:15:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-15 07:15:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-15 07:15:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-15 07:15:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-15 07:15:57,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-15 07:15:58,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:58,060 INFO L225 Difference]: With dead ends: 49 [2022-04-15 07:15:58,060 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 07:15:58,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 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-15 07:15:58,062 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 119 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-15 07:15:58,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:15:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 07:15:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-15 07:15:58,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:58,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 07:15:58,087 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 07:15:58,088 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 07:15:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:58,091 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-15 07:15:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-04-15 07:15:58,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:58,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:58,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 41 states. [2022-04-15 07:15:58,093 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 41 states. [2022-04-15 07:15:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:58,103 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-15 07:15:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-04-15 07:15:58,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:58,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:58,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:58,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 07:15:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 07:15:58,111 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 33 [2022-04-15 07:15:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:58,111 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 07:15:58,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-15 07:15:58,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 07:15:58,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 07:15:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 07:15:58,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:58,172 INFO L499 BasicCegarLoop]: 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-15 07:15:58,195 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-15 07:15:58,394 WARN L460 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-15 07:15:58,395 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1036600877, now seen corresponding path program 1 times [2022-04-15 07:15:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:58,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722682868] [2022-04-15 07:15:58,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:15:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1036600877, now seen corresponding path program 2 times [2022-04-15 07:15:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172638830] [2022-04-15 07:15:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:58,414 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:15:58,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437158271] [2022-04-15 07:15:58,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:15:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:15:58,416 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-15 07:15:58,418 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-15 07:15:58,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:15:58,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:15:58,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:15:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:58,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:15:58,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {782#true} call ULTIMATE.init(); {782#true} is VALID [2022-04-15 07:15:58,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {782#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); {782#true} is VALID [2022-04-15 07:15:58,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {782#true} assume true; {782#true} is VALID [2022-04-15 07:15:58,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {782#true} {782#true} #96#return; {782#true} is VALID [2022-04-15 07:15:58,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {782#true} call #t~ret6 := main(); {782#true} is VALID [2022-04-15 07:15:58,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {782#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; {782#true} is VALID [2022-04-15 07:15:58,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {782#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {782#true} is VALID [2022-04-15 07:15:58,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {782#true} ~cond := #in~cond; {782#true} is VALID [2022-04-15 07:15:58,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#true} assume !(0 == ~cond); {782#true} is VALID [2022-04-15 07:15:58,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#true} assume true; {782#true} is VALID [2022-04-15 07:15:58,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {782#true} {782#true} #76#return; {782#true} is VALID [2022-04-15 07:15:58,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {782#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {782#true} is VALID [2022-04-15 07:15:58,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#true} ~cond := #in~cond; {782#true} is VALID [2022-04-15 07:15:58,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#true} assume !(0 == ~cond); {782#true} is VALID [2022-04-15 07:15:58,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {782#true} assume true; {782#true} is VALID [2022-04-15 07:15:58,610 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {782#true} {782#true} #78#return; {782#true} is VALID [2022-04-15 07:15:58,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#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; {782#true} is VALID [2022-04-15 07:15:58,610 INFO L272 TraceCheckUtils]: 17: Hoare triple {782#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {782#true} is VALID [2022-04-15 07:15:58,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#true} ~cond := #in~cond; {782#true} is VALID [2022-04-15 07:15:58,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#true} assume !(0 == ~cond); {782#true} is VALID [2022-04-15 07:15:58,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {782#true} assume true; {782#true} is VALID [2022-04-15 07:15:58,610 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {782#true} {782#true} #80#return; {782#true} is VALID [2022-04-15 07:15:58,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {782#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {782#true} is VALID [2022-04-15 07:15:58,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {782#true} ~cond := #in~cond; {782#true} is VALID [2022-04-15 07:15:58,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#true} assume !(0 == ~cond); {782#true} is VALID [2022-04-15 07:15:58,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#true} assume true; {782#true} is VALID [2022-04-15 07:15:58,611 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {782#true} {782#true} #82#return; {782#true} is VALID [2022-04-15 07:15:58,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {782#true} assume !false; {782#true} is VALID [2022-04-15 07:15:58,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {782#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {871#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:15:58,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {871#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !false; {871#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:15:58,616 INFO L272 TraceCheckUtils]: 30: Hoare triple {871#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:15:58,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:15:58,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {783#false} is VALID [2022-04-15 07:15:58,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {783#false} assume !false; {783#false} is VALID [2022-04-15 07:15:58,618 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-15 07:15:58,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:15:58,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:58,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172638830] [2022-04-15 07:15:58,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:15:58,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437158271] [2022-04-15 07:15:58,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437158271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:58,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:58,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:15:58,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:58,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722682868] [2022-04-15 07:15:58,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722682868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:58,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:58,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:15:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039027744] [2022-04-15 07:15:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 34 [2022-04-15 07:15:58,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:58,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 07:15:58,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:58,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:15:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:15:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:15:58,639 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 07:15:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:58,858 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-15 07:15:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:15:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 34 [2022-04-15 07:15:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 07:15:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-15 07:15:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 07:15:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-15 07:15:58,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-15 07:15:58,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:58,916 INFO L225 Difference]: With dead ends: 47 [2022-04-15 07:15:58,916 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 07:15:58,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:15:58,917 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:58,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 134 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:15:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 07:15:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-04-15 07:15:58,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:58,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:15:58,943 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:15:58,944 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:15:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:58,947 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 07:15:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-15 07:15:58,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:58,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:58,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 45 states. [2022-04-15 07:15:58,948 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 45 states. [2022-04-15 07:15:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:58,951 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 07:15:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-15 07:15:58,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:58,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:58,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:58,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:15:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 07:15:58,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 34 [2022-04-15 07:15:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:58,954 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 07:15:58,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 07:15:58,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-15 07:15:59,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 07:15:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:15:59,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:59,007 INFO L499 BasicCegarLoop]: 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-15 07:15:59,032 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-15 07:15:59,222 WARN L460 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-15 07:15:59,222 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash -844413996, now seen corresponding path program 1 times [2022-04-15 07:15:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:59,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057592282] [2022-04-15 07:15:59,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:15:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash -844413996, now seen corresponding path program 2 times [2022-04-15 07:15:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:59,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764926867] [2022-04-15 07:15:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:59,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:15:59,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760280320] [2022-04-15 07:15:59,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:15:59,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:59,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:15:59,257 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-15 07:15:59,259 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-15 07:15:59,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:15:59,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:15:59,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 07:15:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:59,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:15:59,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {1154#true} call ULTIMATE.init(); {1154#true} is VALID [2022-04-15 07:15:59,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1154#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); {1154#true} is VALID [2022-04-15 07:15:59,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} #96#return; {1154#true} is VALID [2022-04-15 07:15:59,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} call #t~ret6 := main(); {1154#true} is VALID [2022-04-15 07:15:59,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {1154#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; {1154#true} is VALID [2022-04-15 07:15:59,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {1154#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1154#true} is VALID [2022-04-15 07:15:59,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1154#true} {1154#true} #76#return; {1154#true} is VALID [2022-04-15 07:15:59,592 INFO L272 TraceCheckUtils]: 11: Hoare triple {1154#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1154#true} is VALID [2022-04-15 07:15:59,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#true} ~cond := #in~cond; {1195#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:15:59,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1195#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1199#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:15:59,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1199#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:15:59,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1199#(not (= |assume_abort_if_not_#in~cond| 0))} {1154#true} #78#return; {1206#(<= 1 main_~y~0)} is VALID [2022-04-15 07:15:59,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {1206#(<= 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; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,596 INFO L272 TraceCheckUtils]: 17: Hoare triple {1210#(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)); {1154#true} is VALID [2022-04-15 07:15:59,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,597 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1154#true} {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #80#return; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,597 INFO L272 TraceCheckUtils]: 22: Hoare triple {1210#(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)); {1154#true} is VALID [2022-04-15 07:15:59,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,598 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1154#true} {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(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; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,604 INFO L272 TraceCheckUtils]: 30: Hoare triple {1210#(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)); {1154#true} is VALID [2022-04-15 07:15:59,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,606 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1154#true} {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1210#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:15:59,607 INFO L272 TraceCheckUtils]: 35: Hoare triple {1210#(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)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:15:59,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:15:59,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1155#false} is VALID [2022-04-15 07:15:59,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {1155#false} assume !false; {1155#false} is VALID [2022-04-15 07:15:59,609 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-15 07:15:59,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:15:59,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {1155#false} assume !false; {1155#false} is VALID [2022-04-15 07:15:59,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1155#false} is VALID [2022-04-15 07:15:59,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:15:59,834 INFO L272 TraceCheckUtils]: 35: Hoare triple {1288#(= 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)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:15:59,834 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1154#true} {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,835 INFO L272 TraceCheckUtils]: 30: Hoare triple {1288#(= 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)); {1154#true} is VALID [2022-04-15 07:15:59,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {1288#(= 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; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,840 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1154#true} {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,841 INFO L272 TraceCheckUtils]: 22: Hoare triple {1288#(= 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)); {1154#true} is VALID [2022-04-15 07:15:59,842 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1154#true} {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,842 INFO L272 TraceCheckUtils]: 17: Hoare triple {1288#(= 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)); {1154#true} is VALID [2022-04-15 07:15:59,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {1154#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; {1288#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:15:59,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1154#true} {1154#true} #78#return; {1154#true} is VALID [2022-04-15 07:15:59,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,843 INFO L272 TraceCheckUtils]: 11: Hoare triple {1154#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1154#true} is VALID [2022-04-15 07:15:59,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1154#true} {1154#true} #76#return; {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {1154#true} assume !(0 == ~cond); {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#true} ~cond := #in~cond; {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {1154#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1154#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; {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {1154#true} call #t~ret6 := main(); {1154#true} is VALID [2022-04-15 07:15:59,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} #96#return; {1154#true} is VALID [2022-04-15 07:15:59,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1154#true} assume true; {1154#true} is VALID [2022-04-15 07:15:59,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {1154#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); {1154#true} is VALID [2022-04-15 07:15:59,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {1154#true} call ULTIMATE.init(); {1154#true} is VALID [2022-04-15 07:15:59,845 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-15 07:15:59,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:59,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764926867] [2022-04-15 07:15:59,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:15:59,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760280320] [2022-04-15 07:15:59,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760280320] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:15:59,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:15:59,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 07:15:59,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:59,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057592282] [2022-04-15 07:15:59,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057592282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:59,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:59,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:15:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524033365] [2022-04-15 07:15:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:59,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 39 [2022-04-15 07:15:59,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:59,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:15:59,870 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-15 07:15:59,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:15:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:59,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:15:59,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:15:59,872 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:00,084 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 07:16:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:16:00,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 39 [2022-04-15 07:16:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 07:16:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 07:16:00,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-15 07:16:00,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:00,143 INFO L225 Difference]: With dead ends: 55 [2022-04-15 07:16:00,143 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 07:16:00,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 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-15 07:16:00,145 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:00,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:16:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 07:16:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 07:16:00,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:00,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:00,184 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:00,184 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:00,187 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-15 07:16:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-15 07:16:00,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:00,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:00,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 53 states. [2022-04-15 07:16:00,188 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 53 states. [2022-04-15 07:16:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:00,191 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-15 07:16:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-15 07:16:00,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:00,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:00,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:00,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 07:16:00,195 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 39 [2022-04-15 07:16:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:00,195 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 07:16:00,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:00,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 07:16:00,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 07:16:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 07:16:00,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:00,274 INFO L499 BasicCegarLoop]: 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] [2022-04-15 07:16:00,291 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-15 07:16:00,479 WARN L460 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-15 07:16:00,480 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash -644493747, now seen corresponding path program 1 times [2022-04-15 07:16:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1639474946] [2022-04-15 07:16:00,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:16:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -644493747, now seen corresponding path program 2 times [2022-04-15 07:16:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:00,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829847141] [2022-04-15 07:16:00,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:00,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:16:00,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120118680] [2022-04-15 07:16:00,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:16:00,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:16:00,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:16:00,506 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-15 07:16:00,513 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-15 07:16:00,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:16:00,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:16:00,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 07:16:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:00,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:16:00,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1718#true} is VALID [2022-04-15 07:16:00,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#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); {1718#true} is VALID [2022-04-15 07:16:00,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:00,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1718#true} {1718#true} #96#return; {1718#true} is VALID [2022-04-15 07:16:00,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1718#true} call #t~ret6 := main(); {1718#true} is VALID [2022-04-15 07:16:00,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1718#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; {1718#true} is VALID [2022-04-15 07:16:00,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {1718#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1718#true} is VALID [2022-04-15 07:16:00,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} ~cond := #in~cond; {1744#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:16:00,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {1744#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1748#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:16:00,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {1748#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1748#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:16:00,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1748#(not (= |assume_abort_if_not_#in~cond| 0))} {1718#true} #76#return; {1755#(<= 1 main_~x~0)} is VALID [2022-04-15 07:16:00,870 INFO L272 TraceCheckUtils]: 11: Hoare triple {1755#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1718#true} is VALID [2022-04-15 07:16:00,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:00,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:00,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:00,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1718#true} {1755#(<= 1 main_~x~0)} #78#return; {1755#(<= 1 main_~x~0)} is VALID [2022-04-15 07:16:00,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {1755#(<= 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; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {1774#(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)); {1718#true} is VALID [2022-04-15 07:16:00,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:00,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:00,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:00,878 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1718#true} {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #80#return; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,878 INFO L272 TraceCheckUtils]: 22: Hoare triple {1774#(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)); {1718#true} is VALID [2022-04-15 07:16:00,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:00,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:00,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:00,880 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1718#true} {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#(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; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,881 INFO L272 TraceCheckUtils]: 30: Hoare triple {1774#(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)); {1718#true} is VALID [2022-04-15 07:16:00,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:00,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:00,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:00,882 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1718#true} {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,883 INFO L272 TraceCheckUtils]: 35: Hoare triple {1774#(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)); {1718#true} is VALID [2022-04-15 07:16:00,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:00,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:00,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:00,884 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1718#true} {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {1774#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:16:00,885 INFO L272 TraceCheckUtils]: 40: Hoare triple {1774#(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)); {1847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:16:00,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {1847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:16:00,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {1851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1719#false} is VALID [2022-04-15 07:16:00,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2022-04-15 07:16:00,886 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-15 07:16:00,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:16:01,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2022-04-15 07:16:01,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {1851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1719#false} is VALID [2022-04-15 07:16:01,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {1847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:16:01,134 INFO L272 TraceCheckUtils]: 40: Hoare triple {1867#(= 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)); {1847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:16:01,135 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1718#true} {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:01,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:01,135 INFO L272 TraceCheckUtils]: 35: Hoare triple {1867#(= 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)); {1718#true} is VALID [2022-04-15 07:16:01,136 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1718#true} {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:01,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:01,137 INFO L272 TraceCheckUtils]: 30: Hoare triple {1867#(= 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)); {1718#true} is VALID [2022-04-15 07:16:01,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {1867#(= 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; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,139 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1718#true} {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:01,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:01,140 INFO L272 TraceCheckUtils]: 22: Hoare triple {1867#(= 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)); {1718#true} is VALID [2022-04-15 07:16:01,140 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1718#true} {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #80#return; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:01,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:01,141 INFO L272 TraceCheckUtils]: 17: Hoare triple {1867#(= 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)); {1718#true} is VALID [2022-04-15 07:16:01,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {1718#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; {1867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:16:01,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1718#true} {1718#true} #78#return; {1718#true} is VALID [2022-04-15 07:16:01,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:01,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:01,143 INFO L272 TraceCheckUtils]: 11: Hoare triple {1718#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1718#true} is VALID [2022-04-15 07:16:01,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1718#true} {1718#true} #76#return; {1718#true} is VALID [2022-04-15 07:16:01,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1718#true} assume !(0 == ~cond); {1718#true} is VALID [2022-04-15 07:16:01,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} ~cond := #in~cond; {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {1718#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {1718#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; {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {1718#true} call #t~ret6 := main(); {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1718#true} {1718#true} #96#return; {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#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); {1718#true} is VALID [2022-04-15 07:16:01,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1718#true} is VALID [2022-04-15 07:16:01,146 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-15 07:16:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:01,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829847141] [2022-04-15 07:16:01,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:16:01,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120118680] [2022-04-15 07:16:01,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120118680] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:16:01,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:16:01,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 07:16:01,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:01,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1639474946] [2022-04-15 07:16:01,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1639474946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:01,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:01,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:16:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171531994] [2022-04-15 07:16:01,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:01,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 44 [2022-04-15 07:16:01,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:01,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:01,182 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-15 07:16:01,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:16:01,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:01,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:16:01,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:16:01,184 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:01,438 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-15 07:16:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:16:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 44 [2022-04-15 07:16:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 07:16:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 07:16:01,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-15 07:16:01,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:01,496 INFO L225 Difference]: With dead ends: 59 [2022-04-15 07:16:01,496 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 07:16:01,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 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-15 07:16:01,497 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 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-15 07:16:01,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:16:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 07:16:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-15 07:16:01,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:01,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:01,540 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:01,540 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:01,544 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-15 07:16:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 07:16:01,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:01,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:01,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-15 07:16:01,546 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-15 07:16:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:01,549 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-15 07:16:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 07:16:01,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:01,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:01,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:01,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-04-15 07:16:01,553 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 44 [2022-04-15 07:16:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:01,554 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-04-15 07:16:01,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-15 07:16:01,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 69 transitions. [2022-04-15 07:16:01,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-15 07:16:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 07:16:01,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:01,641 INFO L499 BasicCegarLoop]: 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] [2022-04-15 07:16:01,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:16:01,851 WARN L460 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-15 07:16:01,851 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash -79102156, now seen corresponding path program 1 times [2022-04-15 07:16:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208232245] [2022-04-15 07:16:01,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:16:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -79102156, now seen corresponding path program 2 times [2022-04-15 07:16:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:01,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869542230] [2022-04-15 07:16:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:01,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:16:01,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172167256] [2022-04-15 07:16:01,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:16:01,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:16:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:16:01,878 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-15 07:16:01,879 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-15 07:16:01,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:16:01,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:16:01,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 07:16:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:01,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:16:02,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {2336#true} call ULTIMATE.init(); {2336#true} is VALID [2022-04-15 07:16:02,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {2336#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); {2336#true} is VALID [2022-04-15 07:16:02,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {2336#true} assume true; {2336#true} is VALID [2022-04-15 07:16:02,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2336#true} {2336#true} #96#return; {2336#true} is VALID [2022-04-15 07:16:02,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {2336#true} call #t~ret6 := main(); {2336#true} is VALID [2022-04-15 07:16:02,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {2336#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; {2336#true} is VALID [2022-04-15 07:16:02,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {2336#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {2336#true} ~cond := #in~cond; {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {2336#true} assume !(0 == ~cond); {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {2336#true} assume true; {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2336#true} {2336#true} #76#return; {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L272 TraceCheckUtils]: 11: Hoare triple {2336#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {2336#true} ~cond := #in~cond; {2336#true} is VALID [2022-04-15 07:16:02,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {2336#true} assume !(0 == ~cond); {2336#true} is VALID [2022-04-15 07:16:02,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {2336#true} assume true; {2336#true} is VALID [2022-04-15 07:16:02,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2336#true} {2336#true} #78#return; {2336#true} is VALID [2022-04-15 07:16:02,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {2336#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; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,264 INFO L272 TraceCheckUtils]: 17: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2336#true} is VALID [2022-04-15 07:16:02,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {2336#true} ~cond := #in~cond; {2336#true} is VALID [2022-04-15 07:16:02,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {2336#true} assume !(0 == ~cond); {2336#true} is VALID [2022-04-15 07:16:02,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {2336#true} assume true; {2336#true} is VALID [2022-04-15 07:16:02,265 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2336#true} {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #80#return; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,265 INFO L272 TraceCheckUtils]: 22: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2336#true} is VALID [2022-04-15 07:16:02,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {2336#true} ~cond := #in~cond; {2336#true} is VALID [2022-04-15 07:16:02,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#true} assume !(0 == ~cond); {2336#true} is VALID [2022-04-15 07:16:02,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {2336#true} assume true; {2336#true} is VALID [2022-04-15 07:16:02,266 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2336#true} {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #82#return; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,268 INFO L272 TraceCheckUtils]: 30: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2336#true} is VALID [2022-04-15 07:16:02,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {2336#true} ~cond := #in~cond; {2336#true} is VALID [2022-04-15 07:16:02,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {2336#true} assume !(0 == ~cond); {2336#true} is VALID [2022-04-15 07:16:02,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {2336#true} assume true; {2336#true} is VALID [2022-04-15 07:16:02,269 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2336#true} {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #84#return; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,269 INFO L272 TraceCheckUtils]: 35: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~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)); {2336#true} is VALID [2022-04-15 07:16:02,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {2336#true} ~cond := #in~cond; {2450#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:16:02,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {2450#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:16:02,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:16:02,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #86#return; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,271 INFO L272 TraceCheckUtils]: 40: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~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)); {2336#true} is VALID [2022-04-15 07:16:02,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {2336#true} ~cond := #in~cond; {2450#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:16:02,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {2450#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:16:02,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:16:02,273 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2454#(not (= |__VERIFIER_assert_#in~cond| 0))} {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #88#return; {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-15 07:16:02,274 INFO L272 TraceCheckUtils]: 45: Hoare triple {2389#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~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)); {2479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:16:02,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {2479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:16:02,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2337#false} is VALID [2022-04-15 07:16:02,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {2337#false} assume !false; {2337#false} is VALID [2022-04-15 07:16:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 07:16:02,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:16:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869542230] [2022-04-15 07:16:44,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:16:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172167256] [2022-04-15 07:16:44,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172167256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:16:44,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:16:44,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 07:16:44,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:44,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208232245] [2022-04-15 07:16:44,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208232245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:44,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:44,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:16:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012069991] [2022-04-15 07:16:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-04-15 07:16:44,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:44,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 07:16:45,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:45,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:16:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:16:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:16:45,042 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 07:16:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:45,432 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 07:16:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:16:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-04-15 07:16:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 07:16:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-15 07:16:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 07:16:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-15 07:16:45,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-15 07:16:45,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:45,496 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:16:45,496 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 07:16:45,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:16:45,497 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:45,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:16:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 07:16:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-15 07:16:45,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:45,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:45,544 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:45,544 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:45,547 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 07:16:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 07:16:45,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:45,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:45,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-15 07:16:45,548 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-15 07:16:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:45,551 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 07:16:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-15 07:16:45,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:45,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:45,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:45,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:16:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2022-04-15 07:16:45,554 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 49 [2022-04-15 07:16:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:45,554 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2022-04-15 07:16:45,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 07:16:45,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 72 transitions. [2022-04-15 07:16:45,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-04-15 07:16:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 07:16:45,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:45,634 INFO L499 BasicCegarLoop]: 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] [2022-04-15 07:16:45,651 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-15 07:16:45,835 WARN L460 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-15 07:16:45,835 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2126113716, now seen corresponding path program 1 times [2022-04-15 07:16:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:45,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545688596] [2022-04-15 07:16:45,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:16:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2126113716, now seen corresponding path program 2 times [2022-04-15 07:16:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:45,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968089064] [2022-04-15 07:16:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:45,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:16:45,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459831568] [2022-04-15 07:16:45,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:16:45,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:16:45,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:16:45,849 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-15 07:16:45,852 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-15 07:16:45,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:16:45,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:16:45,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 07:16:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:45,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:16:46,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-15 07:16:46,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#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); {2878#true} is VALID [2022-04-15 07:16:46,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #96#return; {2878#true} is VALID [2022-04-15 07:16:46,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-15 07:16:46,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#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; {2878#true} is VALID [2022-04-15 07:16:46,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {2878#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2878#true} {2878#true} #76#return; {2878#true} is VALID [2022-04-15 07:16:46,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {2878#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,105 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2878#true} {2878#true} #78#return; {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#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; {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L272 TraceCheckUtils]: 17: Hoare triple {2878#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2878#true} {2878#true} #80#return; {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L272 TraceCheckUtils]: 22: Hoare triple {2878#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,107 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2878#true} {2878#true} #82#return; {2878#true} is VALID [2022-04-15 07:16:46,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume !false; {2878#true} is VALID [2022-04-15 07:16:46,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {2878#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:16:46,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:16:46,108 INFO L272 TraceCheckUtils]: 30: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,109 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #84#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:16:46,109 INFO L272 TraceCheckUtils]: 35: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,115 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:16:46,115 INFO L272 TraceCheckUtils]: 40: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:16:46,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,116 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:16:46,117 INFO L272 TraceCheckUtils]: 45: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~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)); {2878#true} is VALID [2022-04-15 07:16:46,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:16:46,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:16:46,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:16:46,118 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:16:46,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3034#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-15 07:16:46,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {3034#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} assume !false; {3034#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-15 07:16:46,120 INFO L272 TraceCheckUtils]: 52: Hoare triple {3034#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:16:46,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:16:46,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {3045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-15 07:16:46,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-15 07:16:46,121 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-15 07:16:46,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:17:03,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-15 07:17:03,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {3045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-15 07:17:03,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:03,147 INFO L272 TraceCheckUtils]: 52: Hoare triple {3061#(= 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)); {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:17:03,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {3061#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3061#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:17:03,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3061#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:17:03,149 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:17:03,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,149 INFO L272 TraceCheckUtils]: 45: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~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)); {2878#true} is VALID [2022-04-15 07:17:03,150 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:17:03,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,151 INFO L272 TraceCheckUtils]: 40: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,152 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:17:03,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,152 INFO L272 TraceCheckUtils]: 35: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,153 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2878#true} {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #84#return; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:17:03,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,153 INFO L272 TraceCheckUtils]: 30: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:17:03,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {2878#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2967#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 07:17:03,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume !false; {2878#true} is VALID [2022-04-15 07:17:03,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2878#true} {2878#true} #82#return; {2878#true} is VALID [2022-04-15 07:17:03,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L272 TraceCheckUtils]: 22: Hoare triple {2878#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2878#true} {2878#true} #80#return; {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L272 TraceCheckUtils]: 17: Hoare triple {2878#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#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; {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2878#true} {2878#true} #78#return; {2878#true} is VALID [2022-04-15 07:17:03,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {2878#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2878#true} {2878#true} #76#return; {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {2878#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-15 07:17:03,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#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; {2878#true} is VALID [2022-04-15 07:17:03,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-15 07:17:03,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #96#return; {2878#true} is VALID [2022-04-15 07:17:03,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 07:17:03,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#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); {2878#true} is VALID [2022-04-15 07:17:03,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-15 07:17:03,157 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-15 07:17:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968089064] [2022-04-15 07:17:03,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:17:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459831568] [2022-04-15 07:17:03,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459831568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:17:03,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:17:03,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 07:17:03,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545688596] [2022-04-15 07:17:03,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545688596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:03,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:03,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:17:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279169326] [2022-04-15 07:17:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:03,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-15 07:17:03,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:03,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:17:03,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:03,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:17:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:17:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:17:03,195 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:17:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:03,584 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2022-04-15 07:17:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:17:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-15 07:17:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:17:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-15 07:17:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:17:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-15 07:17:03,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-15 07:17:03,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:03,660 INFO L225 Difference]: With dead ends: 88 [2022-04-15 07:17:03,660 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 07:17:03,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:17:03,661 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:03,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 182 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:17:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 07:17:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2022-04-15 07:17:03,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:03,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 76 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:17:03,725 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 76 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:17:03,725 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 76 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:17:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:03,730 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2022-04-15 07:17:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2022-04-15 07:17:03,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:03,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:03,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 86 states. [2022-04-15 07:17:03,731 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 86 states. [2022-04-15 07:17:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:03,736 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2022-04-15 07:17:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2022-04-15 07:17:03,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:03,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:03,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:03,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:17:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-15 07:17:03,742 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 56 [2022-04-15 07:17:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:03,743 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-15 07:17:03,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:17:03,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 97 transitions. [2022-04-15 07:17:03,882 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-15 07:17:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-15 07:17:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 07:17:03,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:03,883 INFO L499 BasicCegarLoop]: 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] [2022-04-15 07:17:03,908 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-15 07:17:04,084 WARN L460 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-15 07:17:04,084 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1051433450, now seen corresponding path program 1 times [2022-04-15 07:17:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:04,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1069554234] [2022-04-15 07:17:04,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:17:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1051433450, now seen corresponding path program 2 times [2022-04-15 07:17:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:04,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285352753] [2022-04-15 07:17:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:04,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:04,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:17:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949243729] [2022-04-15 07:17:04,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:17:04,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:17:04,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:17:04,112 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-15 07:17:04,120 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-15 07:17:04,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:17:04,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:17:04,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:17:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:04,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:17:04,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {3722#true} call ULTIMATE.init(); {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {3722#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); {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3722#true} {3722#true} #96#return; {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {3722#true} call #t~ret6 := main(); {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {3722#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; {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {3722#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {3722#true} ~cond := #in~cond; {3748#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:17:04,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {3748#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3752#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:17:04,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {3752#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3752#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:17:04,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3752#(not (= |assume_abort_if_not_#in~cond| 0))} {3722#true} #76#return; {3759#(<= 1 main_~x~0)} is VALID [2022-04-15 07:17:04,403 INFO L272 TraceCheckUtils]: 11: Hoare triple {3759#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,403 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3722#true} {3759#(<= 1 main_~x~0)} #78#return; {3759#(<= 1 main_~x~0)} is VALID [2022-04-15 07:17:04,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#(<= 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; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,404 INFO L272 TraceCheckUtils]: 17: Hoare triple {3778#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,407 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3722#true} {3778#(<= 1 main_~a~0)} #80#return; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,407 INFO L272 TraceCheckUtils]: 22: Hoare triple {3778#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,409 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3722#true} {3778#(<= 1 main_~a~0)} #82#return; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {3778#(<= 1 main_~a~0)} assume !false; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {3778#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {3815#(<= 1 main_~c~0)} assume !false; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,410 INFO L272 TraceCheckUtils]: 30: Hoare triple {3815#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,411 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #84#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,411 INFO L272 TraceCheckUtils]: 35: Hoare triple {3815#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,412 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #86#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,412 INFO L272 TraceCheckUtils]: 40: Hoare triple {3815#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,413 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #88#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,413 INFO L272 TraceCheckUtils]: 45: Hoare triple {3815#(<= 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)); {3722#true} is VALID [2022-04-15 07:17:04,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,414 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #90#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {3815#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {3815#(<= 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; {3885#(<= 1 main_~b~0)} is VALID [2022-04-15 07:17:04,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {3885#(<= 1 main_~b~0)} assume !false; {3885#(<= 1 main_~b~0)} is VALID [2022-04-15 07:17:04,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {3885#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3723#false} is VALID [2022-04-15 07:17:04,415 INFO L272 TraceCheckUtils]: 54: Hoare triple {3723#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3723#false} is VALID [2022-04-15 07:17:04,415 INFO L290 TraceCheckUtils]: 55: Hoare triple {3723#false} ~cond := #in~cond; {3723#false} is VALID [2022-04-15 07:17:04,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {3723#false} assume 0 == ~cond; {3723#false} is VALID [2022-04-15 07:17:04,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {3723#false} assume !false; {3723#false} is VALID [2022-04-15 07:17:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 07:17:04,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:17:04,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {3723#false} assume !false; {3723#false} is VALID [2022-04-15 07:17:04,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {3723#false} assume 0 == ~cond; {3723#false} is VALID [2022-04-15 07:17:04,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {3723#false} ~cond := #in~cond; {3723#false} is VALID [2022-04-15 07:17:04,712 INFO L272 TraceCheckUtils]: 54: Hoare triple {3723#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3723#false} is VALID [2022-04-15 07:17:04,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {3885#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3723#false} is VALID [2022-04-15 07:17:04,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {3885#(<= 1 main_~b~0)} assume !false; {3885#(<= 1 main_~b~0)} is VALID [2022-04-15 07:17:04,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {3815#(<= 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; {3885#(<= 1 main_~b~0)} is VALID [2022-04-15 07:17:04,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {3815#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,715 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #90#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,715 INFO L272 TraceCheckUtils]: 45: Hoare triple {3815#(<= 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)); {3722#true} is VALID [2022-04-15 07:17:04,715 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #88#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,716 INFO L272 TraceCheckUtils]: 40: Hoare triple {3815#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,716 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #86#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,717 INFO L272 TraceCheckUtils]: 35: Hoare triple {3815#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,717 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3722#true} {3815#(<= 1 main_~c~0)} #84#return; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,718 INFO L272 TraceCheckUtils]: 30: Hoare triple {3815#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {3815#(<= 1 main_~c~0)} assume !false; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {3778#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3815#(<= 1 main_~c~0)} is VALID [2022-04-15 07:17:04,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {3778#(<= 1 main_~a~0)} assume !false; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,719 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3722#true} {3778#(<= 1 main_~a~0)} #82#return; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,719 INFO L272 TraceCheckUtils]: 22: Hoare triple {3778#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,720 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3722#true} {3778#(<= 1 main_~a~0)} #80#return; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,720 INFO L272 TraceCheckUtils]: 17: Hoare triple {3778#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#(<= 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; {3778#(<= 1 main_~a~0)} is VALID [2022-04-15 07:17:04,721 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3722#true} {3759#(<= 1 main_~x~0)} #78#return; {3759#(<= 1 main_~x~0)} is VALID [2022-04-15 07:17:04,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {3722#true} assume !(0 == ~cond); {3722#true} is VALID [2022-04-15 07:17:04,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {3722#true} ~cond := #in~cond; {3722#true} is VALID [2022-04-15 07:17:04,721 INFO L272 TraceCheckUtils]: 11: Hoare triple {3759#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3752#(not (= |assume_abort_if_not_#in~cond| 0))} {3722#true} #76#return; {3759#(<= 1 main_~x~0)} is VALID [2022-04-15 07:17:04,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {3752#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3752#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:17:04,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {4054#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3752#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:17:04,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {3722#true} ~cond := #in~cond; {4054#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 07:17:04,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {3722#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {3722#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; {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {3722#true} call #t~ret6 := main(); {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3722#true} {3722#true} #96#return; {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {3722#true} assume true; {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {3722#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); {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {3722#true} call ULTIMATE.init(); {3722#true} is VALID [2022-04-15 07:17:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 07:17:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285352753] [2022-04-15 07:17:04,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:17:04,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949243729] [2022-04-15 07:17:04,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949243729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:17:04,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:17:04,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 07:17:04,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:04,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1069554234] [2022-04-15 07:17:04,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1069554234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:04,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:04,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:17:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571730066] [2022-04-15 07:17:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 58 [2022-04-15 07:17:04,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:04,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-15 07:17:04,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:04,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:17:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:17:04,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:17:04,773 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-15 07:17:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:05,586 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2022-04-15 07:17:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:17:05,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 58 [2022-04-15 07:17:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-15 07:17:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-15 07:17:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-15 07:17:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-15 07:17:05,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-15 07:17:05,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:05,688 INFO L225 Difference]: With dead ends: 121 [2022-04-15 07:17:05,689 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 07:17:05,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:17:05,690 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:05,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 243 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:17:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 07:17:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2022-04-15 07:17:05,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:05,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 102 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 39 states have call successors, (39), 9 states have call predecessors, (39), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 07:17:05,855 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 102 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 39 states have call successors, (39), 9 states have call predecessors, (39), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 07:17:05,855 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 102 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 39 states have call successors, (39), 9 states have call predecessors, (39), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 07:17:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:05,860 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2022-04-15 07:17:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-04-15 07:17:05,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:05,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:05,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 39 states have call successors, (39), 9 states have call predecessors, (39), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 113 states. [2022-04-15 07:17:05,862 INFO L87 Difference]: Start difference. First operand has 102 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 39 states have call successors, (39), 9 states have call predecessors, (39), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 113 states. [2022-04-15 07:17:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:05,867 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2022-04-15 07:17:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-04-15 07:17:05,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:05,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:05,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:05,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 39 states have call successors, (39), 9 states have call predecessors, (39), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 07:17:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2022-04-15 07:17:05,873 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 58 [2022-04-15 07:17:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:05,873 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2022-04-15 07:17:05,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-15 07:17:05,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 140 transitions. [2022-04-15 07:17:06,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2022-04-15 07:17:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 07:17:06,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:06,079 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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-15 07:17:06,098 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-15 07:17:06,291 WARN L460 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-15 07:17:06,292 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash 998199389, now seen corresponding path program 1 times [2022-04-15 07:17:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:06,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888226354] [2022-04-15 07:17:06,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:17:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 998199389, now seen corresponding path program 2 times [2022-04-15 07:17:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:06,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768753413] [2022-04-15 07:17:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:06,317 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:17:06,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993738753] [2022-04-15 07:17:06,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:17:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:17:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:17:06,319 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-15 07:17:06,326 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-15 07:17:06,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:17:06,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:17:06,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 07:17:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:06,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:17:06,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#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); {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #96#return; {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret6 := main(); {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#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; {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {4760#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4760#true} {4760#true} #76#return; {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L272 TraceCheckUtils]: 11: Hoare triple {4760#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4760#true} {4760#true} #78#return; {4760#true} is VALID [2022-04-15 07:17:06,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {4760#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; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,675 INFO L272 TraceCheckUtils]: 17: Hoare triple {4813#(and (= 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)); {4760#true} is VALID [2022-04-15 07:17:06,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,675 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4760#true} {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #80#return; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,675 INFO L272 TraceCheckUtils]: 22: Hoare triple {4813#(and (= 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)); {4760#true} is VALID [2022-04-15 07:17:06,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,676 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4760#true} {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {4813#(and (= 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; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,677 INFO L272 TraceCheckUtils]: 30: Hoare triple {4813#(and (= 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)); {4760#true} is VALID [2022-04-15 07:17:06,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,678 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4760#true} {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,678 INFO L272 TraceCheckUtils]: 35: Hoare triple {4813#(and (= 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)); {4760#true} is VALID [2022-04-15 07:17:06,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4760#true} {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,679 INFO L272 TraceCheckUtils]: 40: Hoare triple {4813#(and (= 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)); {4760#true} is VALID [2022-04-15 07:17:06,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {4760#true} ~cond := #in~cond; {4889#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:06,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {4889#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:06,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:06,681 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,681 INFO L272 TraceCheckUtils]: 45: Hoare triple {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~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)); {4760#true} is VALID [2022-04-15 07:17:06,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,682 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4760#true} {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #90#return; {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 07:17:06,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {4813#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-15 07:17:06,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !false; {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-15 07:17:06,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {4921#(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; {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-15 07:17:06,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !false; {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-15 07:17:06,698 INFO L272 TraceCheckUtils]: 55: Hoare triple {4921#(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)); {4760#true} is VALID [2022-04-15 07:17:06,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:06,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:06,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:06,700 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4760#true} {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #84#return; {4921#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-15 07:17:06,703 INFO L272 TraceCheckUtils]: 60: Hoare triple {4921#(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)); {4949#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:17:06,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {4949#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4953#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:06,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {4953#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4761#false} is VALID [2022-04-15 07:17:06,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-15 07:17:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 07:17:06,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:17:22,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {4761#false} assume !false; {4761#false} is VALID [2022-04-15 07:17:22,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {4953#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4761#false} is VALID [2022-04-15 07:17:22,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {4949#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4953#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:22,347 INFO L272 TraceCheckUtils]: 60: Hoare triple {4969#(= 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)); {4949#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:17:22,348 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4760#true} {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:17:22,348 INFO L290 TraceCheckUtils]: 58: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,348 INFO L290 TraceCheckUtils]: 57: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,348 INFO L272 TraceCheckUtils]: 55: Hoare triple {4969#(= 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)); {4760#true} is VALID [2022-04-15 07:17:22,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:17:22,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {4969#(= 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; {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:17:22,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:17:22,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {4997#(= 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; {4969#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:17:22,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {4997#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4997#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:22,351 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4760#true} {4997#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #90#return; {4997#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:22,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,351 INFO L272 TraceCheckUtils]: 45: Hoare triple {4997#(= 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)); {4760#true} is VALID [2022-04-15 07:17:22,352 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} {4760#true} #88#return; {4997#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:22,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:22,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {5028#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {4760#true} ~cond := #in~cond; {5028#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:17:22,353 INFO L272 TraceCheckUtils]: 40: Hoare triple {4760#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4760#true} {4760#true} #86#return; {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L272 TraceCheckUtils]: 35: Hoare triple {4760#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4760#true} {4760#true} #84#return; {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,353 INFO L272 TraceCheckUtils]: 30: Hoare triple {4760#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {4760#true} assume !false; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {4760#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {4760#true} assume !false; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4760#true} {4760#true} #82#return; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L272 TraceCheckUtils]: 22: Hoare triple {4760#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4760#true} {4760#true} #80#return; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,354 INFO L272 TraceCheckUtils]: 17: Hoare triple {4760#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {4760#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; {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4760#true} {4760#true} #78#return; {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L272 TraceCheckUtils]: 11: Hoare triple {4760#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4760#true} {4760#true} #76#return; {4760#true} is VALID [2022-04-15 07:17:22,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {4760#true} assume !(0 == ~cond); {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {4760#true} ~cond := #in~cond; {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {4760#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {4760#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; {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {4760#true} call #t~ret6 := main(); {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4760#true} {4760#true} #96#return; {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {4760#true} assume true; {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#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); {4760#true} is VALID [2022-04-15 07:17:22,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {4760#true} call ULTIMATE.init(); {4760#true} is VALID [2022-04-15 07:17:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 07:17:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:22,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768753413] [2022-04-15 07:17:22,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:17:22,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993738753] [2022-04-15 07:17:22,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993738753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:17:22,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:17:22,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-15 07:17:22,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:22,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888226354] [2022-04-15 07:17:22,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888226354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:22,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:22,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:17:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135737394] [2022-04-15 07:17:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:22,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 64 [2022-04-15 07:17:22,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:22,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-15 07:17:22,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:22,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:17:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:22,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:17:22,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:17:22,402 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-15 07:17:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:23,055 INFO L93 Difference]: Finished difference Result 147 states and 208 transitions. [2022-04-15 07:17:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:17:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 64 [2022-04-15 07:17:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-15 07:17:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-15 07:17:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-15 07:17:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-15 07:17:23,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-15 07:17:23,140 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-15 07:17:23,143 INFO L225 Difference]: With dead ends: 147 [2022-04-15 07:17:23,143 INFO L226 Difference]: Without dead ends: 144 [2022-04-15 07:17:23,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:17:23,145 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:23,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 157 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:17:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-15 07:17:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-15 07:17:23,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:23,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 58 states have call successors, (58), 10 states have call predecessors, (58), 9 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:23,382 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 58 states have call successors, (58), 10 states have call predecessors, (58), 9 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:23,382 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 58 states have call successors, (58), 10 states have call predecessors, (58), 9 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:23,388 INFO L93 Difference]: Finished difference Result 144 states and 204 transitions. [2022-04-15 07:17:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2022-04-15 07:17:23,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:23,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:23,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 58 states have call successors, (58), 10 states have call predecessors, (58), 9 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 144 states. [2022-04-15 07:17:23,390 INFO L87 Difference]: Start difference. First operand has 141 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 58 states have call successors, (58), 10 states have call predecessors, (58), 9 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 144 states. [2022-04-15 07:17:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:23,395 INFO L93 Difference]: Finished difference Result 144 states and 204 transitions. [2022-04-15 07:17:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2022-04-15 07:17:23,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:23,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:23,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:23,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 58 states have call successors, (58), 10 states have call predecessors, (58), 9 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 201 transitions. [2022-04-15 07:17:23,402 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 201 transitions. Word has length 64 [2022-04-15 07:17:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:23,402 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 201 transitions. [2022-04-15 07:17:23,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-15 07:17:23,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 201 transitions. [2022-04-15 07:17:23,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 201 transitions. [2022-04-15 07:17:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 07:17:23,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:23,660 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2022-04-15 07:17:23,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 07:17:23,860 WARN L460 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-15 07:17:23,861 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:23,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1412509540, now seen corresponding path program 3 times [2022-04-15 07:17:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:23,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755254128] [2022-04-15 07:17:23,862 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:17:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1412509540, now seen corresponding path program 4 times [2022-04-15 07:17:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329864672] [2022-04-15 07:17:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:23,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:17:23,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131577311] [2022-04-15 07:17:23,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:17:23,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:17:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:17:23,881 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-15 07:17:23,882 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-15 07:17:23,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:17:23,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:17:23,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 07:17:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:23,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:17:24,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {6022#true} call ULTIMATE.init(); {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {6022#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); {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6022#true} {6022#true} #96#return; {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {6022#true} call #t~ret6 := main(); {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {6022#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; {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {6022#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:24,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {6022#true} ~cond := #in~cond; {6048#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:17:24,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {6048#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6052#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:17:24,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6052#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:17:24,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6052#(not (= |assume_abort_if_not_#in~cond| 0))} {6022#true} #76#return; {6059#(<= 1 main_~x~0)} is VALID [2022-04-15 07:17:24,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {6059#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:24,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6022#true} {6059#(<= 1 main_~x~0)} #78#return; {6059#(<= 1 main_~x~0)} is VALID [2022-04-15 07:17:24,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {6059#(<= 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; {6078#(and (= main_~r~0 0) (<= 1 main_~x~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-15 07:17:24,682 INFO L272 TraceCheckUtils]: 17: Hoare triple {6078#(and (= main_~r~0 0) (<= 1 main_~x~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)); {6022#true} is VALID [2022-04-15 07:17:24,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,688 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6022#true} {6078#(and (= main_~r~0 0) (<= 1 main_~x~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))} #80#return; {6078#(and (= main_~r~0 0) (<= 1 main_~x~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-15 07:17:24,688 INFO L272 TraceCheckUtils]: 22: Hoare triple {6078#(and (= main_~r~0 0) (<= 1 main_~x~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)); {6022#true} is VALID [2022-04-15 07:17:24,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,689 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6022#true} {6078#(and (= main_~r~0 0) (<= 1 main_~x~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; {6078#(and (= main_~r~0 0) (<= 1 main_~x~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-15 07:17:24,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {6078#(and (= main_~r~0 0) (<= 1 main_~x~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 !false; {6078#(and (= main_~r~0 0) (<= 1 main_~x~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-15 07:17:24,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {6078#(and (= main_~r~0 0) (<= 1 main_~x~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; {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:17:24,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:17:24,691 INFO L272 TraceCheckUtils]: 30: Hoare triple {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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)); {6022#true} is VALID [2022-04-15 07:17:24,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,692 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6022#true} {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #84#return; {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:17:24,693 INFO L272 TraceCheckUtils]: 35: Hoare triple {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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)); {6022#true} is VALID [2022-04-15 07:17:24,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,693 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6022#true} {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:17:24,694 INFO L272 TraceCheckUtils]: 40: Hoare triple {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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)); {6022#true} is VALID [2022-04-15 07:17:24,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,694 INFO L290 TraceCheckUtils]: 43: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,694 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6022#true} {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:17:24,695 INFO L272 TraceCheckUtils]: 45: Hoare triple {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:24,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,696 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6022#true} {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:17:24,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {6115#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6182#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~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-15 07:17:24,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {6182#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~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; {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 07:17:24,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 07:17:24,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 07:17:24,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 07:17:24,698 INFO L272 TraceCheckUtils]: 55: Hoare triple {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:24,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,699 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6022#true} {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #84#return; {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 07:17:24,699 INFO L272 TraceCheckUtils]: 60: Hoare triple {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:24,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:24,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:24,699 INFO L290 TraceCheckUtils]: 63: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:24,704 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6022#true} {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 07:17:24,705 INFO L272 TraceCheckUtils]: 65: Hoare triple {6186#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:17:24,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {6229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:24,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {6233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6023#false} is VALID [2022-04-15 07:17:24,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {6023#false} assume !false; {6023#false} is VALID [2022-04-15 07:17:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-15 07:17:24,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:17:25,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {6023#false} assume !false; {6023#false} is VALID [2022-04-15 07:17:25,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {6233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6023#false} is VALID [2022-04-15 07:17:25,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {6229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:25,250 INFO L272 TraceCheckUtils]: 65: Hoare triple {6249#(= 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)); {6229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:17:25,251 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6022#true} {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:25,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,251 INFO L272 TraceCheckUtils]: 60: Hoare triple {6249#(= 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)); {6022#true} is VALID [2022-04-15 07:17:25,252 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6022#true} {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:25,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,252 INFO L272 TraceCheckUtils]: 55: Hoare triple {6249#(= 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)); {6022#true} is VALID [2022-04-15 07:17:25,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:25,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {6249#(= 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; {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:25,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:25,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {6292#(= (+ (* (+ (* (* 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; {6249#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:17:25,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {6296#(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) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {6292#(= (+ (* (+ (* (* 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-15 07:17:25,597 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6022#true} {6296#(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) (<= main_~b~0 main_~c~0))} #90#return; {6296#(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) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:17:25,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,597 INFO L272 TraceCheckUtils]: 45: Hoare triple {6296#(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) (<= 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)); {6022#true} is VALID [2022-04-15 07:17:25,598 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6022#true} {6296#(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) (<= main_~b~0 main_~c~0))} #88#return; {6296#(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) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:17:25,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,598 INFO L272 TraceCheckUtils]: 40: Hoare triple {6296#(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) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,599 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6022#true} {6296#(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) (<= main_~b~0 main_~c~0))} #86#return; {6296#(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) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:17:25,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,599 INFO L272 TraceCheckUtils]: 35: Hoare triple {6296#(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) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,600 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6022#true} {6296#(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) (<= main_~b~0 main_~c~0))} #84#return; {6296#(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) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:17:25,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,600 INFO L272 TraceCheckUtils]: 30: Hoare triple {6296#(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) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {6296#(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) (<= main_~b~0 main_~c~0))} assume !false; {6296#(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) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:17:25,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6296#(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) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:17:25,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-15 07:17:25,602 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6022#true} {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} #82#return; {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-15 07:17:25,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,602 INFO L272 TraceCheckUtils]: 22: Hoare triple {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,603 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6022#true} {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} #80#return; {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-15 07:17:25,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,603 INFO L272 TraceCheckUtils]: 17: Hoare triple {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {6022#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; {6363#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-15 07:17:25,604 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6022#true} {6022#true} #78#return; {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L272 TraceCheckUtils]: 11: Hoare triple {6022#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6022#true} {6022#true} #76#return; {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {6022#true} assume !(0 == ~cond); {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {6022#true} ~cond := #in~cond; {6022#true} is VALID [2022-04-15 07:17:25,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {6022#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {6022#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; {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {6022#true} call #t~ret6 := main(); {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6022#true} {6022#true} #96#return; {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {6022#true} assume true; {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {6022#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); {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {6022#true} call ULTIMATE.init(); {6022#true} is VALID [2022-04-15 07:17:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 07:17:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:25,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329864672] [2022-04-15 07:17:25,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:17:25,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131577311] [2022-04-15 07:17:25,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131577311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:17:25,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:17:25,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-15 07:17:25,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:25,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755254128] [2022-04-15 07:17:25,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755254128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:25,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:17:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779782669] [2022-04-15 07:17:25,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:25,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-15 07:17:25,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:25,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:17:25,649 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-15 07:17:25,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:17:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:17:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:17:25,650 INFO L87 Difference]: Start difference. First operand 141 states and 201 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:17:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:26,912 INFO L93 Difference]: Finished difference Result 153 states and 211 transitions. [2022-04-15 07:17:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:17:26,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-15 07:17:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:17:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-04-15 07:17:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:17:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-04-15 07:17:26,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2022-04-15 07:17:27,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:27,024 INFO L225 Difference]: With dead ends: 153 [2022-04-15 07:17:27,024 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 07:17:27,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:17:27,025 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 33 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:27,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 215 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:17:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 07:17:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-04-15 07:17:27,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:27,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 149 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 58 states have call successors, (58), 12 states have call predecessors, (58), 11 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:27,266 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 149 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 58 states have call successors, (58), 12 states have call predecessors, (58), 11 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:27,266 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 149 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 58 states have call successors, (58), 12 states have call predecessors, (58), 11 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:27,272 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2022-04-15 07:17:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 209 transitions. [2022-04-15 07:17:27,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:27,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:27,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 58 states have call successors, (58), 12 states have call predecessors, (58), 11 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 151 states. [2022-04-15 07:17:27,274 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 58 states have call successors, (58), 12 states have call predecessors, (58), 11 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 151 states. [2022-04-15 07:17:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:27,279 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2022-04-15 07:17:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 209 transitions. [2022-04-15 07:17:27,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:27,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:27,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:27,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 58 states have call successors, (58), 12 states have call predecessors, (58), 11 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:17:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 207 transitions. [2022-04-15 07:17:27,288 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 207 transitions. Word has length 69 [2022-04-15 07:17:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:27,289 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 207 transitions. [2022-04-15 07:17:27,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:17:27,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 207 transitions. [2022-04-15 07:17:27,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2022-04-15 07:17:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 07:17:27,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:27,573 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2022-04-15 07:17:27,594 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-15 07:17:27,788 WARN L460 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-15 07:17:27,788 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:27,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1763593091, now seen corresponding path program 5 times [2022-04-15 07:17:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177016455] [2022-04-15 07:17:27,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:17:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1763593091, now seen corresponding path program 6 times [2022-04-15 07:17:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123137227] [2022-04-15 07:17:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:27,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:17:27,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471968769] [2022-04-15 07:17:27,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:17:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:17:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:17:27,800 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-15 07:17:27,806 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-15 07:17:27,852 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:17:27,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:17:27,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 07:17:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:27,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:17:28,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {7364#true} call ULTIMATE.init(); {7364#true} is VALID [2022-04-15 07:17:28,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {7364#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); {7364#true} is VALID [2022-04-15 07:17:28,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7364#true} {7364#true} #96#return; {7364#true} is VALID [2022-04-15 07:17:28,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {7364#true} call #t~ret6 := main(); {7364#true} is VALID [2022-04-15 07:17:28,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {7364#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; {7364#true} is VALID [2022-04-15 07:17:28,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {7364#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7364#true} {7364#true} #76#return; {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L272 TraceCheckUtils]: 11: Hoare triple {7364#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,516 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7364#true} {7364#true} #78#return; {7364#true} is VALID [2022-04-15 07:17:28,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {7364#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; {7417#(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))} is VALID [2022-04-15 07:17:28,517 INFO L272 TraceCheckUtils]: 17: Hoare triple {7417#(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))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,519 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7364#true} {7417#(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))} #80#return; {7417#(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))} is VALID [2022-04-15 07:17:28,519 INFO L272 TraceCheckUtils]: 22: Hoare triple {7417#(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))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,524 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7364#true} {7417#(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))} #82#return; {7417#(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))} is VALID [2022-04-15 07:17:28,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {7417#(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))} assume !false; {7417#(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))} is VALID [2022-04-15 07:17:28,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {7417#(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))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7454#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:17:28,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {7454#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {7454#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:17:28,525 INFO L272 TraceCheckUtils]: 30: Hoare triple {7454#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {7364#true} ~cond := #in~cond; {7464#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:28,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {7464#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:28,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:28,527 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} {7454#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {7475#(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))} is VALID [2022-04-15 07:17:28,527 INFO L272 TraceCheckUtils]: 35: Hoare triple {7475#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,528 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7364#true} {7475#(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))} #86#return; {7475#(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))} is VALID [2022-04-15 07:17:28,528 INFO L272 TraceCheckUtils]: 40: Hoare triple {7475#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7364#true} is VALID [2022-04-15 07:17:28,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {7364#true} ~cond := #in~cond; {7464#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:28,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {7464#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:28,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:28,530 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} {7475#(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))} #88#return; {7475#(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))} is VALID [2022-04-15 07:17:28,530 INFO L272 TraceCheckUtils]: 45: Hoare triple {7475#(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))} 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)); {7364#true} is VALID [2022-04-15 07:17:28,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,535 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7364#true} {7475#(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))} #90#return; {7475#(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))} is VALID [2022-04-15 07:17:28,535 INFO L290 TraceCheckUtils]: 50: Hoare triple {7475#(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))} assume !(~c~0 >= ~b~0); {7475#(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))} is VALID [2022-04-15 07:17:28,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {7475#(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))} ~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; {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,537 INFO L272 TraceCheckUtils]: 55: Hoare triple {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~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)); {7364#true} is VALID [2022-04-15 07:17:28,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,538 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7364#true} {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,538 INFO L272 TraceCheckUtils]: 60: Hoare triple {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~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)); {7364#true} is VALID [2022-04-15 07:17:28,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {7364#true} ~cond := #in~cond; {7364#true} is VALID [2022-04-15 07:17:28,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {7364#true} assume !(0 == ~cond); {7364#true} is VALID [2022-04-15 07:17:28,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {7364#true} assume true; {7364#true} is VALID [2022-04-15 07:17:28,539 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7364#true} {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,539 INFO L272 TraceCheckUtils]: 65: Hoare triple {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~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)); {7364#true} is VALID [2022-04-15 07:17:28,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {7364#true} ~cond := #in~cond; {7464#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:28,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {7464#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:28,540 INFO L290 TraceCheckUtils]: 68: Hoare triple {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:17:28,540 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7468#(not (= |__VERIFIER_assert_#in~cond| 0))} {7527#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {7582#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:17:28,543 INFO L272 TraceCheckUtils]: 70: Hoare triple {7582#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~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)); {7586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:17:28,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {7586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:17:28,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {7590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7365#false} is VALID [2022-04-15 07:17:28,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {7365#false} assume !false; {7365#false} is VALID [2022-04-15 07:17:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 07:17:28,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:18:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:19,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123137227] [2022-04-15 07:18:19,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:18:19,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471968769] [2022-04-15 07:18:19,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471968769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:18:19,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:18:19,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 07:18:19,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:19,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177016455] [2022-04-15 07:18:19,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177016455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:19,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:19,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:18:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933133137] [2022-04-15 07:18:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-15 07:18:19,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:19,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 07:18:19,165 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-15 07:18:19,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:18:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:18:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:18:19,165 INFO L87 Difference]: Start difference. First operand 149 states and 207 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 07:18:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:20,475 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2022-04-15 07:18:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:18:20,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-15 07:18:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 07:18:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-15 07:18:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 07:18:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-15 07:18:20,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2022-04-15 07:18:20,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:20,576 INFO L225 Difference]: With dead ends: 161 [2022-04-15 07:18:20,576 INFO L226 Difference]: Without dead ends: 159 [2022-04-15 07:18:20,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:18:20,577 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:20,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 180 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:18:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-15 07:18:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-04-15 07:18:20,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:20,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 157 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 58 states have call successors, (58), 14 states have call predecessors, (58), 13 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:18:20,789 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 157 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 58 states have call successors, (58), 14 states have call predecessors, (58), 13 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:18:20,789 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 157 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 58 states have call successors, (58), 14 states have call predecessors, (58), 13 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:18:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:20,793 INFO L93 Difference]: Finished difference Result 159 states and 215 transitions. [2022-04-15 07:18:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 215 transitions. [2022-04-15 07:18:20,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:20,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:20,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 58 states have call successors, (58), 14 states have call predecessors, (58), 13 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 159 states. [2022-04-15 07:18:20,795 INFO L87 Difference]: Start difference. First operand has 157 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 58 states have call successors, (58), 14 states have call predecessors, (58), 13 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 159 states. [2022-04-15 07:18:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:20,800 INFO L93 Difference]: Finished difference Result 159 states and 215 transitions. [2022-04-15 07:18:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 215 transitions. [2022-04-15 07:18:20,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:20,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:20,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:20,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 58 states have call successors, (58), 14 states have call predecessors, (58), 13 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:18:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 213 transitions. [2022-04-15 07:18:20,806 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 213 transitions. Word has length 74 [2022-04-15 07:18:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:20,806 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 213 transitions. [2022-04-15 07:18:20,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 07:18:20,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 213 transitions. [2022-04-15 07:18:21,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 213 transitions. [2022-04-15 07:18:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 07:18:21,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:21,128 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:21,144 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-15 07:18:21,329 WARN L460 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-15 07:18:21,329 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1525288661, now seen corresponding path program 3 times [2022-04-15 07:18:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:21,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [228165911] [2022-04-15 07:18:21,330 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:18:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1525288661, now seen corresponding path program 4 times [2022-04-15 07:18:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:21,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585290551] [2022-04-15 07:18:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:21,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:18:21,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451565973] [2022-04-15 07:18:21,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:18:21,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:18:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:18:21,353 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-15 07:18:21,356 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-15 07:18:21,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:18:21,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:18:21,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 07:18:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:21,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:18:22,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {8571#true} call ULTIMATE.init(); {8571#true} is VALID [2022-04-15 07:18:22,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {8571#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); {8571#true} is VALID [2022-04-15 07:18:22,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8571#true} {8571#true} #96#return; {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {8571#true} call #t~ret6 := main(); {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {8571#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; {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {8571#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8571#true} {8571#true} #76#return; {8571#true} is VALID [2022-04-15 07:18:22,254 INFO L272 TraceCheckUtils]: 11: Hoare triple {8571#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {8571#true} ~cond := #in~cond; {8612#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:18:22,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {8612#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8616#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:18:22,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {8616#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8616#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:18:22,256 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8616#(not (= |assume_abort_if_not_#in~cond| 0))} {8571#true} #78#return; {8623#(<= 1 main_~y~0)} is VALID [2022-04-15 07:18:22,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {8623#(<= 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; {8627#(<= 1 main_~b~0)} is VALID [2022-04-15 07:18:22,257 INFO L272 TraceCheckUtils]: 17: Hoare triple {8627#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,257 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8571#true} {8627#(<= 1 main_~b~0)} #80#return; {8627#(<= 1 main_~b~0)} is VALID [2022-04-15 07:18:22,257 INFO L272 TraceCheckUtils]: 22: Hoare triple {8627#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,258 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8571#true} {8627#(<= 1 main_~b~0)} #82#return; {8627#(<= 1 main_~b~0)} is VALID [2022-04-15 07:18:22,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {8627#(<= 1 main_~b~0)} assume !false; {8627#(<= 1 main_~b~0)} is VALID [2022-04-15 07:18:22,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {8627#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !false; {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,262 INFO L272 TraceCheckUtils]: 30: Hoare triple {8664#(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)); {8571#true} is VALID [2022-04-15 07:18:22,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,263 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8571#true} {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #84#return; {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,263 INFO L272 TraceCheckUtils]: 35: Hoare triple {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,264 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8571#true} {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #86#return; {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,264 INFO L272 TraceCheckUtils]: 40: Hoare triple {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,265 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8571#true} {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #88#return; {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,265 INFO L272 TraceCheckUtils]: 45: Hoare triple {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,266 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8571#true} {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #90#return; {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,267 INFO L290 TraceCheckUtils]: 50: Hoare triple {8664#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8731#(and (<= 1 main_~k~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {8731#(and (<= 1 main_~k~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (<= 1 main_~b~0))} assume !false; {8731#(and (<= 1 main_~k~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,268 INFO L272 TraceCheckUtils]: 52: Hoare triple {8731#(and (<= 1 main_~k~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {8571#true} ~cond := #in~cond; {8741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:18:22,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {8741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:22,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:22,270 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} {8731#(and (<= 1 main_~k~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (<= 1 main_~b~0))} #84#return; {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,270 INFO L272 TraceCheckUtils]: 57: Hoare triple {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,271 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8571#true} {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} #86#return; {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,271 INFO L272 TraceCheckUtils]: 62: Hoare triple {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,271 INFO L290 TraceCheckUtils]: 64: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,272 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8571#true} {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} #88#return; {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,272 INFO L272 TraceCheckUtils]: 67: Hoare triple {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:22,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:22,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:22,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:22,273 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8571#true} {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} #90#return; {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,275 INFO L290 TraceCheckUtils]: 72: Hoare triple {8752#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8801#(and (= (+ main_~a~0 (* (- 1) main_~b~0) (* (+ (- 1) main_~k~0) main_~b~0)) main_~a~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {8801#(and (= (+ main_~a~0 (* (- 1) main_~b~0) (* (+ (- 1) main_~k~0) main_~b~0)) main_~a~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (<= 1 main_~b~0))} assume !false; {8801#(and (= (+ main_~a~0 (* (- 1) main_~b~0) (* (+ (- 1) main_~k~0) main_~b~0)) main_~a~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:18:22,277 INFO L272 TraceCheckUtils]: 74: Hoare triple {8801#(and (= (+ main_~a~0 (* (- 1) main_~b~0) (* (+ (- 1) main_~k~0) main_~b~0)) main_~a~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:18:22,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {8808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:18:22,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {8812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8572#false} is VALID [2022-04-15 07:18:22,278 INFO L290 TraceCheckUtils]: 77: Hoare triple {8572#false} assume !false; {8572#false} is VALID [2022-04-15 07:18:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-15 07:18:22,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:18:26,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {8572#false} assume !false; {8572#false} is VALID [2022-04-15 07:18:26,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {8812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8572#false} is VALID [2022-04-15 07:18:26,993 INFO L290 TraceCheckUtils]: 75: Hoare triple {8808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:18:26,993 INFO L272 TraceCheckUtils]: 74: Hoare triple {8828#(= 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)); {8808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:18:26,994 INFO L290 TraceCheckUtils]: 73: Hoare triple {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:18:26,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:18:26,996 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8571#true} {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:18:26,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:26,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:26,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:26,996 INFO L272 TraceCheckUtils]: 67: Hoare triple {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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)); {8571#true} is VALID [2022-04-15 07:18:26,997 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8571#true} {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:18:26,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:26,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:26,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:26,997 INFO L272 TraceCheckUtils]: 62: Hoare triple {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:26,998 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8571#true} {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #86#return; {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:18:26,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:26,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:26,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:26,998 INFO L272 TraceCheckUtils]: 57: Hoare triple {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:26,999 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} {8571#true} #84#return; {8828#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:18:26,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:26,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {8892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:27,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {8571#true} ~cond := #in~cond; {8892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:18:27,000 INFO L272 TraceCheckUtils]: 52: Hoare triple {8571#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,000 INFO L290 TraceCheckUtils]: 51: Hoare triple {8571#true} assume !false; {8571#true} is VALID [2022-04-15 07:18:27,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {8571#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8571#true} is VALID [2022-04-15 07:18:27,000 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8571#true} {8571#true} #90#return; {8571#true} is VALID [2022-04-15 07:18:27,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L272 TraceCheckUtils]: 45: Hoare triple {8571#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)); {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8571#true} {8571#true} #88#return; {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L272 TraceCheckUtils]: 40: Hoare triple {8571#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8571#true} {8571#true} #86#return; {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L272 TraceCheckUtils]: 35: Hoare triple {8571#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8571#true} {8571#true} #84#return; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L272 TraceCheckUtils]: 30: Hoare triple {8571#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {8571#true} assume !false; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {8571#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {8571#true} assume !false; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8571#true} {8571#true} #82#return; {8571#true} is VALID [2022-04-15 07:18:27,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L272 TraceCheckUtils]: 22: Hoare triple {8571#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8571#true} {8571#true} #80#return; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L272 TraceCheckUtils]: 17: Hoare triple {8571#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {8571#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; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8571#true} {8571#true} #78#return; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {8571#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8571#true} {8571#true} #76#return; {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {8571#true} assume !(0 == ~cond); {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {8571#true} ~cond := #in~cond; {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {8571#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {8571#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; {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {8571#true} call #t~ret6 := main(); {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8571#true} {8571#true} #96#return; {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {8571#true} assume true; {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {8571#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); {8571#true} is VALID [2022-04-15 07:18:27,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {8571#true} call ULTIMATE.init(); {8571#true} is VALID [2022-04-15 07:18:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-15 07:18:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585290551] [2022-04-15 07:18:27,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:18:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451565973] [2022-04-15 07:18:27,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451565973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:18:27,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:18:27,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 16 [2022-04-15 07:18:27,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [228165911] [2022-04-15 07:18:27,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [228165911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:27,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:27,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:18:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134557544] [2022-04-15 07:18:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:27,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2022-04-15 07:18:27,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:27,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:18:27,049 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-15 07:18:27,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:18:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:27,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:18:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-15 07:18:27,050 INFO L87 Difference]: Start difference. First operand 157 states and 213 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:18:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:29,624 INFO L93 Difference]: Finished difference Result 179 states and 242 transitions. [2022-04-15 07:18:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:18:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2022-04-15 07:18:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:18:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2022-04-15 07:18:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:18:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2022-04-15 07:18:29,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2022-04-15 07:18:29,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:29,738 INFO L225 Difference]: With dead ends: 179 [2022-04-15 07:18:29,738 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 07:18:29,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:18:29,739 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:29,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 150 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:18:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 07:18:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2022-04-15 07:18:29,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:29,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 171 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 100 states have internal predecessors, (109), 62 states have call successors, (62), 16 states have call predecessors, (62), 15 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-15 07:18:29,987 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 171 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 100 states have internal predecessors, (109), 62 states have call successors, (62), 16 states have call predecessors, (62), 15 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-15 07:18:29,987 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 171 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 100 states have internal predecessors, (109), 62 states have call successors, (62), 16 states have call predecessors, (62), 15 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-15 07:18:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:29,992 INFO L93 Difference]: Finished difference Result 177 states and 240 transitions. [2022-04-15 07:18:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2022-04-15 07:18:29,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:29,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:29,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 100 states have internal predecessors, (109), 62 states have call successors, (62), 16 states have call predecessors, (62), 15 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) Second operand 177 states. [2022-04-15 07:18:29,994 INFO L87 Difference]: Start difference. First operand has 171 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 100 states have internal predecessors, (109), 62 states have call successors, (62), 16 states have call predecessors, (62), 15 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) Second operand 177 states. [2022-04-15 07:18:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:29,999 INFO L93 Difference]: Finished difference Result 177 states and 240 transitions. [2022-04-15 07:18:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2022-04-15 07:18:30,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:30,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:30,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:30,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 100 states have internal predecessors, (109), 62 states have call successors, (62), 16 states have call predecessors, (62), 15 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-15 07:18:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 230 transitions. [2022-04-15 07:18:30,006 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 230 transitions. Word has length 78 [2022-04-15 07:18:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:30,006 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 230 transitions. [2022-04-15 07:18:30,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:18:30,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 230 transitions. [2022-04-15 07:18:30,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 230 transitions. [2022-04-15 07:18:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 07:18:30,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:30,315 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1] [2022-04-15 07:18:30,331 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-15 07:18:30,515 WARN L460 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-15 07:18:30,515 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 815826741, now seen corresponding path program 1 times [2022-04-15 07:18:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:30,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945215221] [2022-04-15 07:18:30,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:18:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 815826741, now seen corresponding path program 2 times [2022-04-15 07:18:30,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:30,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504160291] [2022-04-15 07:18:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:30,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:18:30,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309538010] [2022-04-15 07:18:30,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:18:30,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:18:30,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:18:30,529 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-15 07:18:30,537 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-15 07:18:30,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:18:30,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:18:30,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 07:18:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:30,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:18:31,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {10122#true} call ULTIMATE.init(); {10122#true} is VALID [2022-04-15 07:18:31,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {10122#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); {10122#true} is VALID [2022-04-15 07:18:31,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10122#true} {10122#true} #96#return; {10122#true} is VALID [2022-04-15 07:18:31,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {10122#true} call #t~ret6 := main(); {10122#true} is VALID [2022-04-15 07:18:31,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {10122#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; {10122#true} is VALID [2022-04-15 07:18:31,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {10122#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:18:31,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10122#true} {10122#true} #76#return; {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L272 TraceCheckUtils]: 11: Hoare triple {10122#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,484 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10122#true} {10122#true} #78#return; {10122#true} is VALID [2022-04-15 07:18:31,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {10122#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; {10175#(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-15 07:18:31,485 INFO L272 TraceCheckUtils]: 17: Hoare triple {10175#(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)); {10122#true} is VALID [2022-04-15 07:18:31,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,486 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10122#true} {10175#(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))} #80#return; {10175#(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-15 07:18:31,486 INFO L272 TraceCheckUtils]: 22: Hoare triple {10175#(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)); {10122#true} is VALID [2022-04-15 07:18:31,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,487 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10122#true} {10175#(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; {10175#(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-15 07:18:31,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {10175#(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 !false; {10175#(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-15 07:18:31,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {10175#(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; {10212#(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-15 07:18:31,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {10212#(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 !false; {10212#(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-15 07:18:31,489 INFO L272 TraceCheckUtils]: 30: Hoare triple {10212#(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)); {10122#true} is VALID [2022-04-15 07:18:31,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,490 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10122#true} {10212#(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))} #84#return; {10212#(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-15 07:18:31,490 INFO L272 TraceCheckUtils]: 35: Hoare triple {10212#(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)); {10122#true} is VALID [2022-04-15 07:18:31,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,491 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10122#true} {10212#(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; {10212#(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-15 07:18:31,491 INFO L272 TraceCheckUtils]: 40: Hoare triple {10212#(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)); {10122#true} is VALID [2022-04-15 07:18:31,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,493 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10122#true} {10212#(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; {10212#(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-15 07:18:31,493 INFO L272 TraceCheckUtils]: 45: Hoare triple {10212#(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)); {10122#true} is VALID [2022-04-15 07:18:31,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,494 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10122#true} {10212#(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; {10212#(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-15 07:18:31,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {10212#(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; {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:18:31,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:18:31,495 INFO L272 TraceCheckUtils]: 52: Hoare triple {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= 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)); {10122#true} is VALID [2022-04-15 07:18:31,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,497 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10122#true} {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:18:31,497 INFO L272 TraceCheckUtils]: 57: Hoare triple {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= 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)); {10122#true} is VALID [2022-04-15 07:18:31,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {10122#true} ~cond := #in~cond; {10304#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:18:31,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {10304#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:31,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:31,500 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} {10279#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} is VALID [2022-04-15 07:18:31,500 INFO L272 TraceCheckUtils]: 62: Hoare triple {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:18:31,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {10122#true} ~cond := #in~cond; {10304#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:18:31,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {10304#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:31,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:18:31,502 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} #88#return; {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} is VALID [2022-04-15 07:18:31,502 INFO L272 TraceCheckUtils]: 67: Hoare triple {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~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)); {10122#true} is VALID [2022-04-15 07:18:31,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:18:31,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:18:31,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:18:31,503 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10122#true} {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} #90#return; {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} is VALID [2022-04-15 07:18:31,504 INFO L290 TraceCheckUtils]: 72: Hoare triple {10315#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {10349#(and (= main_~r~0 0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (<= 0 main_~c~0) (= 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-15 07:18:31,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {10349#(and (= main_~r~0 0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (<= 0 main_~c~0) (= 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; {10353#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ main_~x~0 (* main_~y~0 main_~s~0)))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 07:18:31,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {10353#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ main_~x~0 (* main_~y~0 main_~s~0)))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {10353#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ main_~x~0 (* main_~y~0 main_~s~0)))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 07:18:31,506 INFO L290 TraceCheckUtils]: 75: Hoare triple {10353#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ main_~x~0 (* main_~y~0 main_~s~0)))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {10360#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 07:18:31,507 INFO L272 TraceCheckUtils]: 76: Hoare triple {10360#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {10364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:18:31,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {10364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:18:31,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {10368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10123#false} is VALID [2022-04-15 07:18:31,508 INFO L290 TraceCheckUtils]: 79: Hoare triple {10123#false} assume !false; {10123#false} is VALID [2022-04-15 07:18:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 07:18:31,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:19:57,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {10123#false} assume !false; {10123#false} is VALID [2022-04-15 07:19:57,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {10368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10123#false} is VALID [2022-04-15 07:19:57,013 INFO L290 TraceCheckUtils]: 77: Hoare triple {10364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:19:57,013 INFO L272 TraceCheckUtils]: 76: Hoare triple {10384#(= (+ (* 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)); {10364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:19:57,014 INFO L290 TraceCheckUtils]: 75: Hoare triple {10388#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {10384#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-15 07:19:57,014 INFO L290 TraceCheckUtils]: 74: Hoare triple {10388#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {10388#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 07:19:58,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {10395#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 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; {10388#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 07:19:58,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {10399#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {10395#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,424 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10122#true} {10399#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {10399#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,424 INFO L272 TraceCheckUtils]: 67: Hoare triple {10399#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~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)); {10122#true} is VALID [2022-04-15 07:19:58,425 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} {10418#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {10399#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:19:58,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {10428#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:19:58,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {10122#true} ~cond := #in~cond; {10428#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:19:58,426 INFO L272 TraceCheckUtils]: 62: Hoare triple {10418#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,427 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {10418#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:19:58,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {10428#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:19:58,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {10122#true} ~cond := #in~cond; {10428#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:19:58,428 INFO L272 TraceCheckUtils]: 57: Hoare triple {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,429 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10122#true} {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #84#return; {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,429 INFO L272 TraceCheckUtils]: 52: Hoare triple {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !false; {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {10435#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-15 07:19:58,911 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10122#true} {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} #90#return; {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 07:19:58,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,911 INFO L272 TraceCheckUtils]: 45: Hoare triple {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,912 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10122#true} {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} #88#return; {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 07:19:58,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,912 INFO L272 TraceCheckUtils]: 40: Hoare triple {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,913 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10122#true} {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} #86#return; {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 07:19:58,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,913 INFO L272 TraceCheckUtils]: 35: Hoare triple {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,914 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10122#true} {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} #84#return; {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 07:19:58,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,914 INFO L272 TraceCheckUtils]: 30: Hoare triple {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} assume !false; {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {10122#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10469#(or (<= (* main_~b~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {10122#true} assume !false; {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10122#true} {10122#true} #82#return; {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L272 TraceCheckUtils]: 22: Hoare triple {10122#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10122#true} {10122#true} #80#return; {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L272 TraceCheckUtils]: 17: Hoare triple {10122#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {10122#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; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10122#true} {10122#true} #78#return; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {10122#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10122#true} {10122#true} #76#return; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {10122#true} assume !(0 == ~cond); {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {10122#true} ~cond := #in~cond; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {10122#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {10122#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; {10122#true} is VALID [2022-04-15 07:19:58,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {10122#true} call #t~ret6 := main(); {10122#true} is VALID [2022-04-15 07:19:58,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10122#true} {10122#true} #96#return; {10122#true} is VALID [2022-04-15 07:19:58,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {10122#true} assume true; {10122#true} is VALID [2022-04-15 07:19:58,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {10122#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); {10122#true} is VALID [2022-04-15 07:19:58,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {10122#true} call ULTIMATE.init(); {10122#true} is VALID [2022-04-15 07:19:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 07:19:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:58,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504160291] [2022-04-15 07:19:58,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:19:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309538010] [2022-04-15 07:19:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309538010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:19:58,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:19:58,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-15 07:19:58,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945215221] [2022-04-15 07:19:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945215221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:58,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:58,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:19:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119731828] [2022-04-15 07:19:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:58,920 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2022-04-15 07:19:58,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:58,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:19:58,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:58,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:19:58,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:19:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:19:58,970 INFO L87 Difference]: Start difference. First operand 171 states and 230 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:20:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:00,924 INFO L93 Difference]: Finished difference Result 196 states and 266 transitions. [2022-04-15 07:20:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:20:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2022-04-15 07:20:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:20:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-04-15 07:20:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:20:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-04-15 07:20:00,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-04-15 07:20:01,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:01,077 INFO L225 Difference]: With dead ends: 196 [2022-04-15 07:20:01,077 INFO L226 Difference]: Without dead ends: 193 [2022-04-15 07:20:01,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:20:01,078 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:01,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 230 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:20:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-15 07:20:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-04-15 07:20:01,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:01,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 192 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 112 states have internal predecessors, (122), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2022-04-15 07:20:01,381 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 192 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 112 states have internal predecessors, (122), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2022-04-15 07:20:01,381 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 192 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 112 states have internal predecessors, (122), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2022-04-15 07:20:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:01,387 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2022-04-15 07:20:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2022-04-15 07:20:01,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:01,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:01,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 112 states have internal predecessors, (122), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) Second operand 193 states. [2022-04-15 07:20:01,389 INFO L87 Difference]: Start difference. First operand has 192 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 112 states have internal predecessors, (122), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) Second operand 193 states. [2022-04-15 07:20:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:01,395 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2022-04-15 07:20:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2022-04-15 07:20:01,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:01,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:01,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:01,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 112 states have internal predecessors, (122), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2022-04-15 07:20:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2022-04-15 07:20:01,402 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 80 [2022-04-15 07:20:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:01,403 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2022-04-15 07:20:01,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 07:20:01,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 192 states and 261 transitions. [2022-04-15 07:20:01,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2022-04-15 07:20:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 07:20:01,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:01,851 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:01,875 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-15 07:20:02,051 WARN L460 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-15 07:20:02,051 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1902002164, now seen corresponding path program 7 times [2022-04-15 07:20:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:02,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475747373] [2022-04-15 07:20:02,052 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:20:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1902002164, now seen corresponding path program 8 times [2022-04-15 07:20:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:02,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128294582] [2022-04-15 07:20:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:02,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:20:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161311415] [2022-04-15 07:20:02,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:20:02,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:20:02,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:20:02,076 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-15 07:20:02,077 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-15 07:20:02,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:20:02,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:20:02,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:20:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:02,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:20:02,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {11792#true} call ULTIMATE.init(); {11792#true} is VALID [2022-04-15 07:20:02,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {11792#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); {11792#true} is VALID [2022-04-15 07:20:02,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11792#true} {11792#true} #96#return; {11792#true} is VALID [2022-04-15 07:20:02,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {11792#true} call #t~ret6 := main(); {11792#true} is VALID [2022-04-15 07:20:02,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {11792#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; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {11792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11792#true} {11792#true} #76#return; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L272 TraceCheckUtils]: 11: Hoare triple {11792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11792#true} {11792#true} #78#return; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {11792#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; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L272 TraceCheckUtils]: 17: Hoare triple {11792#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11792#true} {11792#true} #80#return; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L272 TraceCheckUtils]: 22: Hoare triple {11792#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11792#true} {11792#true} #82#return; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {11792#true} assume !false; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {11792#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {11792#true} assume !false; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L272 TraceCheckUtils]: 30: Hoare triple {11792#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11792#true} {11792#true} #84#return; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L272 TraceCheckUtils]: 35: Hoare triple {11792#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11792#true} {11792#true} #86#return; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L272 TraceCheckUtils]: 40: Hoare triple {11792#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11792#true} {11792#true} #88#return; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L272 TraceCheckUtils]: 45: Hoare triple {11792#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)); {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,407 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11792#true} {11792#true} #90#return; {11792#true} is VALID [2022-04-15 07:20:02,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {11792#true} assume !(~c~0 >= ~b~0); {11947#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:20:02,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {11947#(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; {11951#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 07:20:02,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {11951#(< main_~b~0 main_~a~0)} assume !false; {11951#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 07:20:02,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {11951#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11958#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:20:02,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {11958#(< main_~b~0 main_~c~0)} assume !false; {11958#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:20:02,408 INFO L272 TraceCheckUtils]: 55: Hoare triple {11958#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,423 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11792#true} {11958#(< main_~b~0 main_~c~0)} #84#return; {11958#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:20:02,423 INFO L272 TraceCheckUtils]: 60: Hoare triple {11958#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,425 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11792#true} {11958#(< main_~b~0 main_~c~0)} #86#return; {11958#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:20:02,425 INFO L272 TraceCheckUtils]: 65: Hoare triple {11958#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11792#true} is VALID [2022-04-15 07:20:02,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,426 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11792#true} {11958#(< main_~b~0 main_~c~0)} #88#return; {11958#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:20:02,426 INFO L272 TraceCheckUtils]: 70: Hoare triple {11958#(< 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)); {11792#true} is VALID [2022-04-15 07:20:02,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {11792#true} ~cond := #in~cond; {11792#true} is VALID [2022-04-15 07:20:02,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {11792#true} assume !(0 == ~cond); {11792#true} is VALID [2022-04-15 07:20:02,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {11792#true} assume true; {11792#true} is VALID [2022-04-15 07:20:02,427 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11792#true} {11958#(< main_~b~0 main_~c~0)} #90#return; {11958#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:20:02,427 INFO L290 TraceCheckUtils]: 75: Hoare triple {11958#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 76: Hoare triple {11793#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; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 77: Hoare triple {11793#false} assume !false; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {11793#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 79: Hoare triple {11793#false} assume !false; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L272 TraceCheckUtils]: 80: Hoare triple {11793#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 81: Hoare triple {11793#false} ~cond := #in~cond; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 82: Hoare triple {11793#false} assume !(0 == ~cond); {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L290 TraceCheckUtils]: 83: Hoare triple {11793#false} assume true; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {11793#false} {11793#false} #84#return; {11793#false} is VALID [2022-04-15 07:20:02,428 INFO L272 TraceCheckUtils]: 85: Hoare triple {11793#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11793#false} is VALID [2022-04-15 07:20:02,429 INFO L290 TraceCheckUtils]: 86: Hoare triple {11793#false} ~cond := #in~cond; {11793#false} is VALID [2022-04-15 07:20:02,429 INFO L290 TraceCheckUtils]: 87: Hoare triple {11793#false} assume 0 == ~cond; {11793#false} is VALID [2022-04-15 07:20:02,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {11793#false} assume !false; {11793#false} is VALID [2022-04-15 07:20:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-04-15 07:20:02,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:20:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:02,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128294582] [2022-04-15 07:20:02,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:20:02,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161311415] [2022-04-15 07:20:02,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161311415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:02,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:02,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:20:02,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:02,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475747373] [2022-04-15 07:20:02,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475747373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:02,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:02,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:20:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172637252] [2022-04-15 07:20:02,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 89 [2022-04-15 07:20:02,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:02,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:20:02,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:02,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:20:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:20:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:20:02,479 INFO L87 Difference]: Start difference. First operand 192 states and 261 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:20:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:03,039 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2022-04-15 07:20:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:20:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 89 [2022-04-15 07:20:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:20:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 07:20:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:20:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 07:20:03,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-15 07:20:03,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:03,134 INFO L225 Difference]: With dead ends: 234 [2022-04-15 07:20:03,134 INFO L226 Difference]: Without dead ends: 175 [2022-04-15 07:20:03,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 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-15 07:20:03,136 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:03,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 143 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:20:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-15 07:20:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 166. [2022-04-15 07:20:03,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:03,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 166 states, 91 states have (on average 1.10989010989011) internal successors, (101), 98 states have internal predecessors, (101), 58 states have call successors, (58), 17 states have call predecessors, (58), 16 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:20:03,529 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 166 states, 91 states have (on average 1.10989010989011) internal successors, (101), 98 states have internal predecessors, (101), 58 states have call successors, (58), 17 states have call predecessors, (58), 16 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:20:03,530 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 166 states, 91 states have (on average 1.10989010989011) internal successors, (101), 98 states have internal predecessors, (101), 58 states have call successors, (58), 17 states have call predecessors, (58), 16 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:20:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:03,534 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2022-04-15 07:20:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 228 transitions. [2022-04-15 07:20:03,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:03,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:03,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 91 states have (on average 1.10989010989011) internal successors, (101), 98 states have internal predecessors, (101), 58 states have call successors, (58), 17 states have call predecessors, (58), 16 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 175 states. [2022-04-15 07:20:03,536 INFO L87 Difference]: Start difference. First operand has 166 states, 91 states have (on average 1.10989010989011) internal successors, (101), 98 states have internal predecessors, (101), 58 states have call successors, (58), 17 states have call predecessors, (58), 16 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 175 states. [2022-04-15 07:20:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:03,540 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2022-04-15 07:20:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 228 transitions. [2022-04-15 07:20:03,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:03,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:03,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:03,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 91 states have (on average 1.10989010989011) internal successors, (101), 98 states have internal predecessors, (101), 58 states have call successors, (58), 17 states have call predecessors, (58), 16 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:20:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2022-04-15 07:20:03,546 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 89 [2022-04-15 07:20:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:03,546 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2022-04-15 07:20:03,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:20:03,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 214 transitions. [2022-04-15 07:20:03,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2022-04-15 07:20:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 07:20:03,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:03,890 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:03,909 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-15 07:20:04,090 WARN L460 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-15 07:20:04,090 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1738688612, now seen corresponding path program 1 times [2022-04-15 07:20:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772370336] [2022-04-15 07:20:04,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:20:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1738688612, now seen corresponding path program 2 times [2022-04-15 07:20:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733417012] [2022-04-15 07:20:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:04,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:04,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:20:04,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852776355] [2022-04-15 07:20:04,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:20:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:20:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:20:04,101 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-15 07:20:04,102 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-15 07:20:04,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:20:04,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:20:04,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 07:20:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:04,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:20:16,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {13217#true} call ULTIMATE.init(); {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {13217#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); {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13217#true} {13217#true} #96#return; {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {13217#true} call #t~ret6 := main(); {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {13217#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; {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {13217#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13217#true} {13217#true} #76#return; {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L272 TraceCheckUtils]: 11: Hoare triple {13217#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13217#true} {13217#true} #78#return; {13217#true} is VALID [2022-04-15 07:20:16,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {13217#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; {13270#(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-15 07:20:16,511 INFO L272 TraceCheckUtils]: 17: Hoare triple {13270#(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)); {13217#true} is VALID [2022-04-15 07:20:16,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,511 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13217#true} {13270#(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))} #80#return; {13270#(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-15 07:20:16,512 INFO L272 TraceCheckUtils]: 22: Hoare triple {13270#(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)); {13217#true} is VALID [2022-04-15 07:20:16,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,512 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13217#true} {13270#(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; {13270#(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-15 07:20:16,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {13270#(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 !false; {13270#(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-15 07:20:16,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {13270#(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; {13307#(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_~c~0 main_~x~0))} is VALID [2022-04-15 07:20:16,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {13307#(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_~c~0 main_~x~0))} assume !false; {13307#(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_~c~0 main_~x~0))} is VALID [2022-04-15 07:20:16,514 INFO L272 TraceCheckUtils]: 30: Hoare triple {13307#(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_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13217#true} is VALID [2022-04-15 07:20:16,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,515 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13217#true} {13307#(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_~c~0 main_~x~0))} #84#return; {13307#(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_~c~0 main_~x~0))} is VALID [2022-04-15 07:20:16,515 INFO L272 TraceCheckUtils]: 35: Hoare triple {13307#(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_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13217#true} is VALID [2022-04-15 07:20:16,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,516 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13217#true} {13307#(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_~c~0 main_~x~0))} #86#return; {13307#(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_~c~0 main_~x~0))} is VALID [2022-04-15 07:20:16,516 INFO L272 TraceCheckUtils]: 40: Hoare triple {13307#(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_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13217#true} is VALID [2022-04-15 07:20:16,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,517 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13217#true} {13307#(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_~c~0 main_~x~0))} #88#return; {13307#(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_~c~0 main_~x~0))} is VALID [2022-04-15 07:20:16,517 INFO L272 TraceCheckUtils]: 45: Hoare triple {13307#(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_~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)); {13217#true} is VALID [2022-04-15 07:20:16,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,518 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13217#true} {13307#(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_~c~0 main_~x~0))} #90#return; {13307#(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_~c~0 main_~x~0))} is VALID [2022-04-15 07:20:16,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {13307#(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_~c~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,519 INFO L272 TraceCheckUtils]: 52: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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)); {13217#true} is VALID [2022-04-15 07:20:16,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,520 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13217#true} {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,520 INFO L272 TraceCheckUtils]: 57: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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)); {13217#true} is VALID [2022-04-15 07:20:16,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,521 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13217#true} {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,521 INFO L272 TraceCheckUtils]: 62: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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)); {13217#true} is VALID [2022-04-15 07:20:16,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {13217#true} ~cond := #in~cond; {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:20:16,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,523 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,523 INFO L272 TraceCheckUtils]: 67: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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)); {13217#true} is VALID [2022-04-15 07:20:16,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {13217#true} ~cond := #in~cond; {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:20:16,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,524 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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); {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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-15 07:20:16,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {13374#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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; {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,526 INFO L290 TraceCheckUtils]: 74: Hoare triple {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,526 INFO L290 TraceCheckUtils]: 75: Hoare triple {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~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; {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,527 INFO L290 TraceCheckUtils]: 76: Hoare triple {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,527 INFO L272 TraceCheckUtils]: 77: Hoare triple {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~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)); {13217#true} is VALID [2022-04-15 07:20:16,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {13217#true} ~cond := #in~cond; {13217#true} is VALID [2022-04-15 07:20:16,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {13217#true} assume !(0 == ~cond); {13217#true} is VALID [2022-04-15 07:20:16,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {13217#true} assume true; {13217#true} is VALID [2022-04-15 07:20:16,528 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13217#true} {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,528 INFO L272 TraceCheckUtils]: 82: Hoare triple {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~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)); {13217#true} is VALID [2022-04-15 07:20:16,529 INFO L290 TraceCheckUtils]: 83: Hoare triple {13217#true} ~cond := #in~cond; {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:20:16,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,531 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} {13446#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {13486#(and (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,531 INFO L272 TraceCheckUtils]: 87: Hoare triple {13486#(and (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~x~0 (+ main_~b~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)); {13217#true} is VALID [2022-04-15 07:20:16,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {13217#true} ~cond := #in~cond; {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:20:16,532 INFO L290 TraceCheckUtils]: 89: Hoare triple {13414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,532 INFO L290 TraceCheckUtils]: 90: Hoare triple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:20:16,533 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13418#(not (= |__VERIFIER_assert_#in~cond| 0))} {13486#(and (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {13502#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:20:16,599 INFO L272 TraceCheckUtils]: 92: Hoare triple {13502#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~x~0 (+ main_~b~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)); {13506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:20:16,600 INFO L290 TraceCheckUtils]: 93: Hoare triple {13506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13510#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:20:16,600 INFO L290 TraceCheckUtils]: 94: Hoare triple {13510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13218#false} is VALID [2022-04-15 07:20:16,600 INFO L290 TraceCheckUtils]: 95: Hoare triple {13218#false} assume !false; {13218#false} is VALID [2022-04-15 07:20:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 96 proven. 28 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-04-15 07:20:16,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:22:05,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733417012] [2022-04-15 07:22:05,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:22:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852776355] [2022-04-15 07:22:05,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852776355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:22:05,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:22:05,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 07:22:05,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772370336] [2022-04-15 07:22:05,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772370336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:05,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:05,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:22:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540143611] [2022-04-15 07:22:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 96 [2022-04-15 07:22:05,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:05,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 07:22:05,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:05,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:22:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:05,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:22:05,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=235, Unknown=3, NotChecked=0, Total=306 [2022-04-15 07:22:05,626 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 07:22:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:18,236 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-04-15 07:22:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:22:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 96 [2022-04-15 07:22:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 07:22:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-15 07:22:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 07:22:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-15 07:22:18,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2022-04-15 07:22:18,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:18,437 INFO L225 Difference]: With dead ends: 181 [2022-04-15 07:22:18,438 INFO L226 Difference]: Without dead ends: 179 [2022-04-15 07:22:18,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=109, Invalid=394, Unknown=3, NotChecked=0, Total=506 [2022-04-15 07:22:18,439 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:18,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 231 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 07:22:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-15 07:22:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2022-04-15 07:22:18,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:18,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 178 states, 100 states have (on average 1.1) internal successors, (110), 107 states have internal predecessors, (110), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:18,744 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 178 states, 100 states have (on average 1.1) internal successors, (110), 107 states have internal predecessors, (110), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:18,744 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 178 states, 100 states have (on average 1.1) internal successors, (110), 107 states have internal predecessors, (110), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:18,749 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2022-04-15 07:22:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 224 transitions. [2022-04-15 07:22:18,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:18,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:18,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 100 states have (on average 1.1) internal successors, (110), 107 states have internal predecessors, (110), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 179 states. [2022-04-15 07:22:18,750 INFO L87 Difference]: Start difference. First operand has 178 states, 100 states have (on average 1.1) internal successors, (110), 107 states have internal predecessors, (110), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 179 states. [2022-04-15 07:22:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:18,755 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2022-04-15 07:22:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 224 transitions. [2022-04-15 07:22:18,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:18,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:18,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:18,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 100 states have (on average 1.1) internal successors, (110), 107 states have internal predecessors, (110), 58 states have call successors, (58), 20 states have call predecessors, (58), 19 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2022-04-15 07:22:18,761 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 96 [2022-04-15 07:22:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:18,761 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2022-04-15 07:22:18,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 07:22:18,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 223 transitions. [2022-04-15 07:22:19,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2022-04-15 07:22:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 07:22:19,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:19,175 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:19,201 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-15 07:22:19,375 WARN L460 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-15 07:22:19,376 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1265808182, now seen corresponding path program 5 times [2022-04-15 07:22:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:19,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662577942] [2022-04-15 07:22:19,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:22:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1265808182, now seen corresponding path program 6 times [2022-04-15 07:22:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:19,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672912907] [2022-04-15 07:22:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:19,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:22:19,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146185130] [2022-04-15 07:22:19,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:22:19,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:22:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:22:19,392 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-15 07:22:19,393 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-15 07:22:19,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 07:22:19,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:22:19,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:22:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:19,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:22:19,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {14683#true} call ULTIMATE.init(); {14683#true} is VALID [2022-04-15 07:22:19,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {14683#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); {14683#true} is VALID [2022-04-15 07:22:19,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14683#true} {14683#true} #96#return; {14683#true} is VALID [2022-04-15 07:22:19,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {14683#true} call #t~ret6 := main(); {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {14683#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; {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L272 TraceCheckUtils]: 6: Hoare triple {14683#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14683#true} {14683#true} #76#return; {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {14683#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14683#true} {14683#true} #78#return; {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {14683#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; {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L272 TraceCheckUtils]: 17: Hoare triple {14683#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14683#true} {14683#true} #80#return; {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L272 TraceCheckUtils]: 22: Hoare triple {14683#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,906 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14683#true} {14683#true} #82#return; {14683#true} is VALID [2022-04-15 07:22:19,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {14683#true} assume !false; {14683#true} is VALID [2022-04-15 07:22:19,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {14683#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !false; {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,907 INFO L272 TraceCheckUtils]: 30: Hoare triple {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,908 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14683#true} {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #84#return; {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,908 INFO L272 TraceCheckUtils]: 35: Hoare triple {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,909 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14683#true} {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #86#return; {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,909 INFO L272 TraceCheckUtils]: 40: Hoare triple {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,910 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14683#true} {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #88#return; {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,910 INFO L272 TraceCheckUtils]: 45: Hoare triple {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= 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)); {14683#true} is VALID [2022-04-15 07:22:19,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,911 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14683#true} {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #90#return; {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {14772#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} assume !false; {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,914 INFO L272 TraceCheckUtils]: 52: Hoare triple {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,914 INFO L290 TraceCheckUtils]: 55: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,915 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14683#true} {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} #84#return; {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,915 INFO L272 TraceCheckUtils]: 57: Hoare triple {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,916 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14683#true} {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} #86#return; {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,916 INFO L272 TraceCheckUtils]: 62: Hoare triple {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,917 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14683#true} {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} #88#return; {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,918 INFO L272 TraceCheckUtils]: 67: Hoare triple {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= 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)); {14683#true} is VALID [2022-04-15 07:22:19,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,919 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14683#true} {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} #90#return; {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 07:22:19,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {14839#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (not (= main_~b~0 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} is VALID [2022-04-15 07:22:19,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} assume !false; {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} is VALID [2022-04-15 07:22:19,920 INFO L272 TraceCheckUtils]: 74: Hoare triple {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,921 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14683#true} {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} #84#return; {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} is VALID [2022-04-15 07:22:19,921 INFO L272 TraceCheckUtils]: 79: Hoare triple {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,922 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {14683#true} {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} #86#return; {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} is VALID [2022-04-15 07:22:19,922 INFO L272 TraceCheckUtils]: 84: Hoare triple {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:19,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,923 INFO L290 TraceCheckUtils]: 87: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,923 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14683#true} {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} #88#return; {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} is VALID [2022-04-15 07:22:19,923 INFO L272 TraceCheckUtils]: 89: Hoare triple {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~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)); {14683#true} is VALID [2022-04-15 07:22:19,924 INFO L290 TraceCheckUtils]: 90: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:19,924 INFO L290 TraceCheckUtils]: 91: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:19,924 INFO L290 TraceCheckUtils]: 92: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:19,925 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {14683#true} {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} #90#return; {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} is VALID [2022-04-15 07:22:19,926 INFO L290 TraceCheckUtils]: 94: Hoare triple {14906#(and (not (= main_~b~0 0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= (+ (- 2) main_~k~0) 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14973#(and (= main_~k~0 3) (not (= main_~b~0 0)) (= main_~c~0 (+ (* main_~b~0 (- 3)) main_~a~0)))} is VALID [2022-04-15 07:22:19,926 INFO L290 TraceCheckUtils]: 95: Hoare triple {14973#(and (= main_~k~0 3) (not (= main_~b~0 0)) (= main_~c~0 (+ (* main_~b~0 (- 3)) main_~a~0)))} assume !false; {14973#(and (= main_~k~0 3) (not (= main_~b~0 0)) (= main_~c~0 (+ (* main_~b~0 (- 3)) main_~a~0)))} is VALID [2022-04-15 07:22:19,927 INFO L272 TraceCheckUtils]: 96: Hoare triple {14973#(and (= main_~k~0 3) (not (= main_~b~0 0)) (= main_~c~0 (+ (* main_~b~0 (- 3)) main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:22:19,927 INFO L290 TraceCheckUtils]: 97: Hoare triple {14980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:19,928 INFO L290 TraceCheckUtils]: 98: Hoare triple {14984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14684#false} is VALID [2022-04-15 07:22:19,928 INFO L290 TraceCheckUtils]: 99: Hoare triple {14684#false} assume !false; {14684#false} is VALID [2022-04-15 07:22:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-15 07:22:19,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:22:20,296 INFO L290 TraceCheckUtils]: 99: Hoare triple {14684#false} assume !false; {14684#false} is VALID [2022-04-15 07:22:20,296 INFO L290 TraceCheckUtils]: 98: Hoare triple {14984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14684#false} is VALID [2022-04-15 07:22:20,297 INFO L290 TraceCheckUtils]: 97: Hoare triple {14980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:20,297 INFO L272 TraceCheckUtils]: 96: Hoare triple {15000#(= 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)); {14980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:22:20,297 INFO L290 TraceCheckUtils]: 95: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,299 INFO L290 TraceCheckUtils]: 94: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,300 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,300 INFO L290 TraceCheckUtils]: 92: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,300 INFO L290 TraceCheckUtils]: 91: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,300 INFO L290 TraceCheckUtils]: 90: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,300 INFO L272 TraceCheckUtils]: 89: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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)); {14683#true} is VALID [2022-04-15 07:22:20,301 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,301 INFO L290 TraceCheckUtils]: 87: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,301 INFO L272 TraceCheckUtils]: 84: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,302 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #86#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,302 INFO L272 TraceCheckUtils]: 79: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,302 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #84#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,303 INFO L290 TraceCheckUtils]: 76: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,303 INFO L290 TraceCheckUtils]: 75: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,303 INFO L272 TraceCheckUtils]: 74: Hoare triple {15000#(= 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)); {14683#true} is VALID [2022-04-15 07:22:20,303 INFO L290 TraceCheckUtils]: 73: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,305 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,305 INFO L272 TraceCheckUtils]: 67: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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)); {14683#true} is VALID [2022-04-15 07:22:20,306 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,306 INFO L272 TraceCheckUtils]: 62: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,307 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #86#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,307 INFO L290 TraceCheckUtils]: 59: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,307 INFO L272 TraceCheckUtils]: 57: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,307 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #84#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,308 INFO L272 TraceCheckUtils]: 52: Hoare triple {15000#(= 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)); {14683#true} is VALID [2022-04-15 07:22:20,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,310 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,311 INFO L272 TraceCheckUtils]: 45: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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)); {14683#true} is VALID [2022-04-15 07:22:20,311 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,312 INFO L272 TraceCheckUtils]: 40: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,312 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #86#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,312 INFO L272 TraceCheckUtils]: 35: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,313 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14683#true} {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #84#return; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,313 INFO L272 TraceCheckUtils]: 30: Hoare triple {15000#(= 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)); {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {14683#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {15000#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {14683#true} assume !false; {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14683#true} {14683#true} #82#return; {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L272 TraceCheckUtils]: 22: Hoare triple {14683#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14683#true} {14683#true} #80#return; {14683#true} is VALID [2022-04-15 07:22:20,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L272 TraceCheckUtils]: 17: Hoare triple {14683#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {14683#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; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14683#true} {14683#true} #78#return; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L272 TraceCheckUtils]: 11: Hoare triple {14683#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14683#true} {14683#true} #76#return; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {14683#true} assume !(0 == ~cond); {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {14683#true} ~cond := #in~cond; {14683#true} is VALID [2022-04-15 07:22:20,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {14683#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {14683#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; {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {14683#true} call #t~ret6 := main(); {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14683#true} {14683#true} #96#return; {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {14683#true} assume true; {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {14683#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); {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {14683#true} call ULTIMATE.init(); {14683#true} is VALID [2022-04-15 07:22:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 07:22:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672912907] [2022-04-15 07:22:20,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:22:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146185130] [2022-04-15 07:22:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146185130] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:22:20,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:22:20,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 07:22:20,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:20,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662577942] [2022-04-15 07:22:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662577942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:20,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:20,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:22:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628244688] [2022-04-15 07:22:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:20,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-04-15 07:22:20,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:20,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:22:20,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:20,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:22:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:22:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:22:20,358 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:22:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:20,765 INFO L93 Difference]: Finished difference Result 184 states and 228 transitions. [2022-04-15 07:22:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:22:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-04-15 07:22:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:22:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-15 07:22:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:22:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-15 07:22:20,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-15 07:22:20,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:20,804 INFO L225 Difference]: With dead ends: 184 [2022-04-15 07:22:20,804 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 07:22:20,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:22:20,805 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:20,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:22:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 07:22:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-15 07:22:21,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:21,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 58 states have call successors, (58), 21 states have call predecessors, (58), 20 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:21,103 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 58 states have call successors, (58), 21 states have call predecessors, (58), 20 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:21,103 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 58 states have call successors, (58), 21 states have call predecessors, (58), 20 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:21,108 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2022-04-15 07:22:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2022-04-15 07:22:21,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:21,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:21,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 58 states have call successors, (58), 21 states have call predecessors, (58), 20 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 182 states. [2022-04-15 07:22:21,109 INFO L87 Difference]: Start difference. First operand has 182 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 58 states have call successors, (58), 21 states have call predecessors, (58), 20 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 182 states. [2022-04-15 07:22:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:21,114 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2022-04-15 07:22:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2022-04-15 07:22:21,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:21,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:21,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:21,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 58 states have call successors, (58), 21 states have call predecessors, (58), 20 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-15 07:22:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2022-04-15 07:22:21,119 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 226 transitions. Word has length 100 [2022-04-15 07:22:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:21,120 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 226 transitions. [2022-04-15 07:22:21,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 07:22:21,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 226 transitions. [2022-04-15 07:22:21,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2022-04-15 07:22:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 07:22:21,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:21,508 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:21,531 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-15 07:22:21,727 WARN L460 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-15 07:22:21,728 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1068463892, now seen corresponding path program 3 times [2022-04-15 07:22:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852013824] [2022-04-15 07:22:21,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:22:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1068463892, now seen corresponding path program 4 times [2022-04-15 07:22:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:21,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161486779] [2022-04-15 07:22:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:21,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:22:21,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862265811] [2022-04-15 07:22:21,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:22:21,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:22:21,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:22:21,745 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-15 07:22:21,747 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-15 07:22:21,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:22:21,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:22:21,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 07:22:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:21,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:22:28,939 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:22:29,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {16389#true} call ULTIMATE.init(); {16389#true} is VALID [2022-04-15 07:22:29,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {16389#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); {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16389#true} {16389#true} #96#return; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {16389#true} call #t~ret6 := main(); {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {16389#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; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {16389#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16389#true} {16389#true} #76#return; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L272 TraceCheckUtils]: 11: Hoare triple {16389#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,729 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16389#true} {16389#true} #78#return; {16389#true} is VALID [2022-04-15 07:22:29,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {16389#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; {16442#(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-15 07:22:29,729 INFO L272 TraceCheckUtils]: 17: Hoare triple {16442#(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)); {16389#true} is VALID [2022-04-15 07:22:29,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,730 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16389#true} {16442#(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))} #80#return; {16442#(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-15 07:22:29,730 INFO L272 TraceCheckUtils]: 22: Hoare triple {16442#(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)); {16389#true} is VALID [2022-04-15 07:22:29,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,731 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16389#true} {16442#(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; {16442#(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-15 07:22:29,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {16442#(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 !false; {16442#(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-15 07:22:29,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {16442#(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; {16479#(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-15 07:22:29,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {16479#(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 !false; {16479#(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-15 07:22:29,732 INFO L272 TraceCheckUtils]: 30: Hoare triple {16479#(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)); {16389#true} is VALID [2022-04-15 07:22:29,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,733 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16389#true} {16479#(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))} #84#return; {16479#(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-15 07:22:29,733 INFO L272 TraceCheckUtils]: 35: Hoare triple {16479#(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)); {16389#true} is VALID [2022-04-15 07:22:29,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,734 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16389#true} {16479#(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; {16479#(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-15 07:22:29,734 INFO L272 TraceCheckUtils]: 40: Hoare triple {16479#(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)); {16389#true} is VALID [2022-04-15 07:22:29,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,735 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16389#true} {16479#(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; {16479#(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-15 07:22:29,735 INFO L272 TraceCheckUtils]: 45: Hoare triple {16479#(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)); {16389#true} is VALID [2022-04-15 07:22:29,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,736 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16389#true} {16479#(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; {16479#(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-15 07:22:29,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {16479#(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; {16546#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {16546#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {16546#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,737 INFO L272 TraceCheckUtils]: 52: Hoare triple {16546#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~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)); {16389#true} is VALID [2022-04-15 07:22:29,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {16389#true} ~cond := #in~cond; {16556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:29,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {16556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:29,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:29,739 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} {16546#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,739 INFO L272 TraceCheckUtils]: 57: Hoare triple {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~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)); {16389#true} is VALID [2022-04-15 07:22:29,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,739 INFO L290 TraceCheckUtils]: 59: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,739 INFO L290 TraceCheckUtils]: 60: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,744 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {16389#true} {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,744 INFO L272 TraceCheckUtils]: 62: Hoare triple {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~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)); {16389#true} is VALID [2022-04-15 07:22:29,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,745 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16389#true} {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,745 INFO L272 TraceCheckUtils]: 67: Hoare triple {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~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)); {16389#true} is VALID [2022-04-15 07:22:29,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,747 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16389#true} {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {16567#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~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; {16616#(and (= main_~r~0 0) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {16616#(and (= main_~r~0 0) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {16616#(and (= main_~r~0 0) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,749 INFO L272 TraceCheckUtils]: 74: Hoare triple {16616#(and (= main_~r~0 0) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~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)); {16389#true} is VALID [2022-04-15 07:22:29,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {16389#true} ~cond := #in~cond; {16556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:29,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {16556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:29,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:29,752 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {16560#(not (= |__VERIFIER_assert_#in~cond| 0))} {16616#(and (= main_~r~0 0) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,752 INFO L272 TraceCheckUtils]: 79: Hoare triple {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16389#true} is VALID [2022-04-15 07:22:29,752 INFO L290 TraceCheckUtils]: 80: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,753 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {16389#true} {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} #86#return; {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,753 INFO L272 TraceCheckUtils]: 84: Hoare triple {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16389#true} is VALID [2022-04-15 07:22:29,753 INFO L290 TraceCheckUtils]: 85: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,754 INFO L290 TraceCheckUtils]: 86: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,754 INFO L290 TraceCheckUtils]: 87: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,755 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16389#true} {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} #88#return; {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,755 INFO L272 TraceCheckUtils]: 89: Hoare triple {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~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)); {16389#true} is VALID [2022-04-15 07:22:29,755 INFO L290 TraceCheckUtils]: 90: Hoare triple {16389#true} ~cond := #in~cond; {16389#true} is VALID [2022-04-15 07:22:29,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {16389#true} assume !(0 == ~cond); {16389#true} is VALID [2022-04-15 07:22:29,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {16389#true} assume true; {16389#true} is VALID [2022-04-15 07:22:29,756 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {16389#true} {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} #90#return; {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,757 INFO L290 TraceCheckUtils]: 94: Hoare triple {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:22:29,759 INFO L290 TraceCheckUtils]: 95: Hoare triple {16635#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 2 main_~k~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~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; {16687#(and (= (+ main_~x~0 (* main_~y~0 2) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (<= (+ main_~s~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-15 07:22:29,759 INFO L290 TraceCheckUtils]: 96: Hoare triple {16687#(and (= (+ main_~x~0 (* main_~y~0 2) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (<= (+ main_~s~0 2) 0) (= main_~q~0 1))} assume !false; {16687#(and (= (+ main_~x~0 (* main_~y~0 2) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (<= (+ main_~s~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-15 07:22:29,760 INFO L290 TraceCheckUtils]: 97: Hoare triple {16687#(and (= (+ main_~x~0 (* main_~y~0 2) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (<= (+ main_~s~0 2) 0) (= main_~q~0 1))} assume !(0 != ~b~0); {16694#(and (= (+ main_~x~0 (* main_~y~0 2) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (<= (+ main_~s~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-15 07:22:29,761 INFO L272 TraceCheckUtils]: 98: Hoare triple {16694#(and (= (+ main_~x~0 (* main_~y~0 2) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (<= (+ main_~s~0 2) 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:22:29,761 INFO L290 TraceCheckUtils]: 99: Hoare triple {16698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:29,762 INFO L290 TraceCheckUtils]: 100: Hoare triple {16702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16390#false} is VALID [2022-04-15 07:22:29,762 INFO L290 TraceCheckUtils]: 101: Hoare triple {16390#false} assume !false; {16390#false} is VALID [2022-04-15 07:22:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 55 proven. 49 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-04-15 07:22:29,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:23:40,615 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:23:46,637 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:23:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:23:48,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161486779] [2022-04-15 07:23:48,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:23:48,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862265811] [2022-04-15 07:23:48,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862265811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:23:48,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:23:48,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 07:23:48,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:23:48,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852013824] [2022-04-15 07:23:48,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852013824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:23:48,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:23:48,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:23:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401536266] [2022-04-15 07:23:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:23:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) Word has length 102 [2022-04-15 07:23:48,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:23:48,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 07:23:48,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:48,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:23:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:23:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=308, Unknown=1, NotChecked=0, Total=380 [2022-04-15 07:23:48,948 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 07:23:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:51,738 INFO L93 Difference]: Finished difference Result 211 states and 269 transitions. [2022-04-15 07:23:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:23:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) Word has length 102 [2022-04-15 07:23:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:23:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 07:23:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-04-15 07:23:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 07:23:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-04-15 07:23:51,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2022-04-15 07:23:51,908 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-15 07:23:51,913 INFO L225 Difference]: With dead ends: 211 [2022-04-15 07:23:51,913 INFO L226 Difference]: Without dead ends: 208 [2022-04-15 07:23:51,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=99, Invalid=452, Unknown=1, NotChecked=0, Total=552 [2022-04-15 07:23:51,914 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:23:51,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 257 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:23:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-15 07:23:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2022-04-15 07:23:52,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:23:52,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 207 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 122 states have internal predecessors, (127), 70 states have call successors, (70), 22 states have call predecessors, (70), 21 states have return successors, (67), 62 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 07:23:52,293 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 207 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 122 states have internal predecessors, (127), 70 states have call successors, (70), 22 states have call predecessors, (70), 21 states have return successors, (67), 62 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 07:23:52,293 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 207 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 122 states have internal predecessors, (127), 70 states have call successors, (70), 22 states have call predecessors, (70), 21 states have return successors, (67), 62 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 07:23:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:52,299 INFO L93 Difference]: Finished difference Result 208 states and 265 transitions. [2022-04-15 07:23:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2022-04-15 07:23:52,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:52,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:52,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 122 states have internal predecessors, (127), 70 states have call successors, (70), 22 states have call predecessors, (70), 21 states have return successors, (67), 62 states have call predecessors, (67), 67 states have call successors, (67) Second operand 208 states. [2022-04-15 07:23:52,301 INFO L87 Difference]: Start difference. First operand has 207 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 122 states have internal predecessors, (127), 70 states have call successors, (70), 22 states have call predecessors, (70), 21 states have return successors, (67), 62 states have call predecessors, (67), 67 states have call successors, (67) Second operand 208 states. [2022-04-15 07:23:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:52,306 INFO L93 Difference]: Finished difference Result 208 states and 265 transitions. [2022-04-15 07:23:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2022-04-15 07:23:52,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:52,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:52,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:23:52,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:23:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 122 states have internal predecessors, (127), 70 states have call successors, (70), 22 states have call predecessors, (70), 21 states have return successors, (67), 62 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 07:23:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 264 transitions. [2022-04-15 07:23:52,314 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 264 transitions. Word has length 102 [2022-04-15 07:23:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:23:52,314 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 264 transitions. [2022-04-15 07:23:52,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 07:23:52,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 264 transitions. [2022-04-15 07:23:52,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 264 transitions. [2022-04-15 07:23:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 07:23:52,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:23:52,830 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:23:52,846 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-15 07:23:53,030 WARN L460 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-15 07:23:53,030 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:23:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:23:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 351496396, now seen corresponding path program 5 times [2022-04-15 07:23:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:53,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50594420] [2022-04-15 07:23:53,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:23:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 351496396, now seen corresponding path program 6 times [2022-04-15 07:23:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:23:53,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389270582] [2022-04-15 07:23:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:23:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:23:53,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:23:53,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895588987] [2022-04-15 07:23:53,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:23:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:23:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:23:53,051 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-15 07:23:53,052 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-15 07:23:53,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:23:53,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:23:53,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:23:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:23:53,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:23:53,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {18067#true} call ULTIMATE.init(); {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {18067#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); {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18067#true} {18067#true} #96#return; {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {18067#true} call #t~ret6 := main(); {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {18067#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; {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {18067#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18067#true} {18067#true} #76#return; {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L272 TraceCheckUtils]: 11: Hoare triple {18067#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18067#true} {18067#true} #78#return; {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {18067#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; {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L272 TraceCheckUtils]: 17: Hoare triple {18067#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18067#true} {18067#true} #80#return; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L272 TraceCheckUtils]: 22: Hoare triple {18067#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18067#true} {18067#true} #82#return; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {18067#true} assume !false; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {18067#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18067#true} is VALID [2022-04-15 07:23:53,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {18067#true} assume !false; {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L272 TraceCheckUtils]: 30: Hoare triple {18067#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18067#true} {18067#true} #84#return; {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L272 TraceCheckUtils]: 35: Hoare triple {18067#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,389 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18067#true} {18067#true} #86#return; {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L272 TraceCheckUtils]: 40: Hoare triple {18067#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18067#true} {18067#true} #88#return; {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L272 TraceCheckUtils]: 45: Hoare triple {18067#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)); {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,391 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {18067#true} {18067#true} #90#return; {18067#true} is VALID [2022-04-15 07:23:53,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {18067#true} assume !(~c~0 >= ~b~0); {18222#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:23:53,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {18222#(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; {18226#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 07:23:53,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {18226#(< main_~b~0 main_~a~0)} assume !false; {18226#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 07:23:53,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {18226#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {18233#(< main_~b~0 main_~c~0)} assume !false; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,397 INFO L272 TraceCheckUtils]: 55: Hoare triple {18233#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,398 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #84#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,398 INFO L272 TraceCheckUtils]: 60: Hoare triple {18233#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,399 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #86#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,399 INFO L272 TraceCheckUtils]: 65: Hoare triple {18233#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,400 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #88#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,400 INFO L272 TraceCheckUtils]: 70: Hoare triple {18233#(< 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)); {18067#true} is VALID [2022-04-15 07:23:53,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,401 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #90#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {18233#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {18300#(< 0 main_~c~0)} assume !false; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,402 INFO L272 TraceCheckUtils]: 77: Hoare triple {18300#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,403 INFO L290 TraceCheckUtils]: 78: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,403 INFO L290 TraceCheckUtils]: 79: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,403 INFO L290 TraceCheckUtils]: 80: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,403 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #84#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,403 INFO L272 TraceCheckUtils]: 82: Hoare triple {18300#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,404 INFO L290 TraceCheckUtils]: 84: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,404 INFO L290 TraceCheckUtils]: 85: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,404 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #86#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,404 INFO L272 TraceCheckUtils]: 87: Hoare triple {18300#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,404 INFO L290 TraceCheckUtils]: 88: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,405 INFO L290 TraceCheckUtils]: 89: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,405 INFO L290 TraceCheckUtils]: 90: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,405 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #88#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,405 INFO L272 TraceCheckUtils]: 92: Hoare triple {18300#(< 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)); {18067#true} is VALID [2022-04-15 07:23:53,405 INFO L290 TraceCheckUtils]: 93: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,406 INFO L290 TraceCheckUtils]: 95: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,406 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #90#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {18300#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,407 INFO L290 TraceCheckUtils]: 98: Hoare triple {18300#(< 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; {18370#(< 0 main_~b~0)} is VALID [2022-04-15 07:23:53,407 INFO L290 TraceCheckUtils]: 99: Hoare triple {18370#(< 0 main_~b~0)} assume !false; {18370#(< 0 main_~b~0)} is VALID [2022-04-15 07:23:53,408 INFO L290 TraceCheckUtils]: 100: Hoare triple {18370#(< 0 main_~b~0)} assume !(0 != ~b~0); {18068#false} is VALID [2022-04-15 07:23:53,408 INFO L272 TraceCheckUtils]: 101: Hoare triple {18068#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {18068#false} is VALID [2022-04-15 07:23:53,408 INFO L290 TraceCheckUtils]: 102: Hoare triple {18068#false} ~cond := #in~cond; {18068#false} is VALID [2022-04-15 07:23:53,408 INFO L290 TraceCheckUtils]: 103: Hoare triple {18068#false} assume 0 == ~cond; {18068#false} is VALID [2022-04-15 07:23:53,408 INFO L290 TraceCheckUtils]: 104: Hoare triple {18068#false} assume !false; {18068#false} is VALID [2022-04-15 07:23:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-15 07:23:53,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:23:53,779 INFO L290 TraceCheckUtils]: 104: Hoare triple {18068#false} assume !false; {18068#false} is VALID [2022-04-15 07:23:53,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {18068#false} assume 0 == ~cond; {18068#false} is VALID [2022-04-15 07:23:53,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {18068#false} ~cond := #in~cond; {18068#false} is VALID [2022-04-15 07:23:53,779 INFO L272 TraceCheckUtils]: 101: Hoare triple {18068#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {18068#false} is VALID [2022-04-15 07:23:53,780 INFO L290 TraceCheckUtils]: 100: Hoare triple {18370#(< 0 main_~b~0)} assume !(0 != ~b~0); {18068#false} is VALID [2022-04-15 07:23:53,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {18370#(< 0 main_~b~0)} assume !false; {18370#(< 0 main_~b~0)} is VALID [2022-04-15 07:23:53,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {18300#(< 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; {18370#(< 0 main_~b~0)} is VALID [2022-04-15 07:23:53,781 INFO L290 TraceCheckUtils]: 97: Hoare triple {18300#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,781 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #90#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,781 INFO L290 TraceCheckUtils]: 95: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,782 INFO L290 TraceCheckUtils]: 94: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,782 INFO L272 TraceCheckUtils]: 92: Hoare triple {18300#(< 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)); {18067#true} is VALID [2022-04-15 07:23:53,782 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #88#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,783 INFO L290 TraceCheckUtils]: 89: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,783 INFO L290 TraceCheckUtils]: 88: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,783 INFO L272 TraceCheckUtils]: 87: Hoare triple {18300#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,783 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #86#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,783 INFO L290 TraceCheckUtils]: 85: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,784 INFO L290 TraceCheckUtils]: 83: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,784 INFO L272 TraceCheckUtils]: 82: Hoare triple {18300#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,784 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {18067#true} {18300#(< 0 main_~c~0)} #84#return; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,784 INFO L290 TraceCheckUtils]: 80: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,784 INFO L290 TraceCheckUtils]: 79: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,785 INFO L290 TraceCheckUtils]: 78: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,785 INFO L272 TraceCheckUtils]: 77: Hoare triple {18300#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {18300#(< 0 main_~c~0)} assume !false; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {18233#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18300#(< 0 main_~c~0)} is VALID [2022-04-15 07:23:53,787 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #90#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,787 INFO L272 TraceCheckUtils]: 70: Hoare triple {18233#(< 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)); {18067#true} is VALID [2022-04-15 07:23:53,788 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #88#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,788 INFO L272 TraceCheckUtils]: 65: Hoare triple {18233#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,789 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #86#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,789 INFO L272 TraceCheckUtils]: 60: Hoare triple {18233#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,790 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18067#true} {18233#(< main_~b~0 main_~c~0)} #84#return; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,790 INFO L272 TraceCheckUtils]: 55: Hoare triple {18233#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {18233#(< main_~b~0 main_~c~0)} assume !false; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {18226#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18233#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 07:23:53,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {18226#(< main_~b~0 main_~a~0)} assume !false; {18226#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 07:23:53,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {18222#(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; {18226#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {18067#true} assume !(~c~0 >= ~b~0); {18222#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:23:53,792 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {18067#true} {18067#true} #90#return; {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L272 TraceCheckUtils]: 45: Hoare triple {18067#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)); {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18067#true} {18067#true} #88#return; {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L272 TraceCheckUtils]: 40: Hoare triple {18067#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18067#true} {18067#true} #86#return; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L272 TraceCheckUtils]: 35: Hoare triple {18067#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18067#true} {18067#true} #84#return; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,793 INFO L272 TraceCheckUtils]: 30: Hoare triple {18067#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {18067#true} assume !false; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {18067#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {18067#true} assume !false; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18067#true} {18067#true} #82#return; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L272 TraceCheckUtils]: 22: Hoare triple {18067#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18067#true} {18067#true} #80#return; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L272 TraceCheckUtils]: 17: Hoare triple {18067#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {18067#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; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18067#true} {18067#true} #78#return; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L272 TraceCheckUtils]: 11: Hoare triple {18067#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18067#true} {18067#true} #76#return; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {18067#true} assume !(0 == ~cond); {18067#true} is VALID [2022-04-15 07:23:53,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {18067#true} ~cond := #in~cond; {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {18067#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {18067#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; {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {18067#true} call #t~ret6 := main(); {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18067#true} {18067#true} #96#return; {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {18067#true} assume true; {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {18067#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); {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {18067#true} call ULTIMATE.init(); {18067#true} is VALID [2022-04-15 07:23:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-15 07:23:53,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:23:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389270582] [2022-04-15 07:23:53,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:23:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895588987] [2022-04-15 07:23:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895588987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:23:53,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:23:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-15 07:23:53,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:23:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50594420] [2022-04-15 07:23:53,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50594420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:23:53,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:23:53,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:23:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070782288] [2022-04-15 07:23:53,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:23:53,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 105 [2022-04-15 07:23:53,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:23:53,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-15 07:23:53,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:53,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:23:53,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:53,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:23:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:23:53,852 INFO L87 Difference]: Start difference. First operand 207 states and 264 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-15 07:23:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:55,306 INFO L93 Difference]: Finished difference Result 257 states and 349 transitions. [2022-04-15 07:23:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:23:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 105 [2022-04-15 07:23:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:23:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-15 07:23:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-04-15 07:23:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-15 07:23:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-04-15 07:23:55,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 121 transitions. [2022-04-15 07:23:55,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:55,452 INFO L225 Difference]: With dead ends: 257 [2022-04-15 07:23:55,452 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 07:23:55,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:23:55,453 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:23:55,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:23:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 07:23:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2022-04-15 07:23:55,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:23:55,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 230 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 07:23:55,941 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 230 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 07:23:55,942 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 230 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 07:23:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:55,949 INFO L93 Difference]: Finished difference Result 249 states and 340 transitions. [2022-04-15 07:23:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 340 transitions. [2022-04-15 07:23:55,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:55,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:55,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand 249 states. [2022-04-15 07:23:55,951 INFO L87 Difference]: Start difference. First operand has 230 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand 249 states. [2022-04-15 07:23:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:55,958 INFO L93 Difference]: Finished difference Result 249 states and 340 transitions. [2022-04-15 07:23:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 340 transitions. [2022-04-15 07:23:55,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:55,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:55,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:23:55,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:23:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 07:23:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 307 transitions. [2022-04-15 07:23:55,966 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 307 transitions. Word has length 105 [2022-04-15 07:23:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:23:55,966 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 307 transitions. [2022-04-15 07:23:55,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-15 07:23:55,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 307 transitions. [2022-04-15 07:23:56,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 307 transitions. [2022-04-15 07:23:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 07:23:56,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:23:56,588 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:23:56,614 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-15 07:23:56,788 WARN L460 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-15 07:23:56,788 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:23:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:23:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2080181613, now seen corresponding path program 3 times [2022-04-15 07:23:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:56,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289779383] [2022-04-15 07:23:56,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:23:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2080181613, now seen corresponding path program 4 times [2022-04-15 07:23:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:23:56,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453628738] [2022-04-15 07:23:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:23:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:23:56,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:23:56,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927904422] [2022-04-15 07:23:56,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:23:56,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:23:56,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:23:56,808 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:23:56,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 07:23:56,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:23:56,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:23:56,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 07:23:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:23:56,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:23:59,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {20194#true} call ULTIMATE.init(); {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {20194#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); {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20194#true} {20194#true} #96#return; {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {20194#true} call #t~ret6 := main(); {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {20194#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; {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {20194#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {20194#true} ~cond := #in~cond; {20220#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:23:59,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {20220#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {20224#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:23:59,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {20224#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {20224#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:23:59,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20224#(not (= |assume_abort_if_not_#in~cond| 0))} {20194#true} #76#return; {20231#(<= 1 main_~x~0)} is VALID [2022-04-15 07:23:59,377 INFO L272 TraceCheckUtils]: 11: Hoare triple {20231#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,378 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20194#true} {20231#(<= 1 main_~x~0)} #78#return; {20231#(<= 1 main_~x~0)} is VALID [2022-04-15 07:23:59,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {20231#(<= 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; {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,378 INFO L272 TraceCheckUtils]: 17: Hoare triple {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,379 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20194#true} {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} #80#return; {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,379 INFO L272 TraceCheckUtils]: 22: Hoare triple {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,380 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20194#true} {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} #82#return; {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} assume !false; {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {20250#(and (<= 1 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} assume !false; {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,381 INFO L272 TraceCheckUtils]: 30: Hoare triple {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,382 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20194#true} {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} #84#return; {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,382 INFO L272 TraceCheckUtils]: 35: Hoare triple {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,383 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20194#true} {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} #86#return; {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,383 INFO L272 TraceCheckUtils]: 40: Hoare triple {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,384 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20194#true} {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} #88#return; {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,384 INFO L272 TraceCheckUtils]: 45: Hoare triple {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 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)); {20194#true} is VALID [2022-04-15 07:23:59,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,384 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {20194#true} {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} #90#return; {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {20287#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0))} assume !(~c~0 >= ~b~0); {20354#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-15 07:23:59,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {20354#(and (<= main_~c~0 main_~x~0) (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (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; {20358#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~a~0))} is VALID [2022-04-15 07:23:59,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {20358#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~a~0))} assume !false; {20358#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~a~0))} is VALID [2022-04-15 07:23:59,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {20358#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} is VALID [2022-04-15 07:23:59,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} assume !false; {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} is VALID [2022-04-15 07:23:59,387 INFO L272 TraceCheckUtils]: 55: Hoare triple {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,387 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20194#true} {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} #84#return; {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} is VALID [2022-04-15 07:23:59,387 INFO L272 TraceCheckUtils]: 60: Hoare triple {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,388 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20194#true} {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} #86#return; {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} is VALID [2022-04-15 07:23:59,388 INFO L272 TraceCheckUtils]: 65: Hoare triple {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,389 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20194#true} {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} #88#return; {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} is VALID [2022-04-15 07:23:59,389 INFO L272 TraceCheckUtils]: 70: Hoare triple {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~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)); {20194#true} is VALID [2022-04-15 07:23:59,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,390 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20194#true} {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} #90#return; {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} is VALID [2022-04-15 07:23:59,391 INFO L290 TraceCheckUtils]: 75: Hoare triple {20365#(and (<= main_~b~0 main_~x~0) (<= 1 main_~x~0) (< main_~b~0 main_~y~0) (<= main_~y~0 main_~c~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} assume !false; {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,392 INFO L272 TraceCheckUtils]: 77: Hoare triple {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,392 INFO L290 TraceCheckUtils]: 79: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,392 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20194#true} {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} #84#return; {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,393 INFO L272 TraceCheckUtils]: 82: Hoare triple {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,393 INFO L290 TraceCheckUtils]: 83: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,394 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20194#true} {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} #86#return; {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,394 INFO L272 TraceCheckUtils]: 87: Hoare triple {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {20194#true} ~cond := #in~cond; {20472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:23:59,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {20472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:59,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:59,397 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} {20432#(and (<= main_~b~0 main_~x~0) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} #88#return; {20483#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,397 INFO L272 TraceCheckUtils]: 92: Hoare triple {20483#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 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)); {20194#true} is VALID [2022-04-15 07:23:59,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,397 INFO L290 TraceCheckUtils]: 94: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,398 INFO L290 TraceCheckUtils]: 95: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,398 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20194#true} {20483#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} #90#return; {20483#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} is VALID [2022-04-15 07:23:59,399 INFO L290 TraceCheckUtils]: 97: Hoare triple {20483#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~x~0) (< main_~b~0 main_~y~0))} assume !(~c~0 >= ~b~0); {20502#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~b~0 main_~y~0) (< main_~y~0 (* main_~b~0 2)))} is VALID [2022-04-15 07:23:59,401 INFO L290 TraceCheckUtils]: 98: Hoare triple {20502#(and (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~b~0 main_~y~0) (< main_~y~0 (* main_~b~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; {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} is VALID [2022-04-15 07:23:59,401 INFO L290 TraceCheckUtils]: 99: Hoare triple {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} assume !false; {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} is VALID [2022-04-15 07:23:59,401 INFO L290 TraceCheckUtils]: 100: Hoare triple {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} is VALID [2022-04-15 07:23:59,402 INFO L290 TraceCheckUtils]: 101: Hoare triple {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} assume !false; {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} is VALID [2022-04-15 07:23:59,402 INFO L272 TraceCheckUtils]: 102: Hoare triple {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:23:59,402 INFO L290 TraceCheckUtils]: 103: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:23:59,402 INFO L290 TraceCheckUtils]: 104: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:23:59,402 INFO L290 TraceCheckUtils]: 105: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:23:59,403 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20194#true} {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} #84#return; {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} is VALID [2022-04-15 07:23:59,404 INFO L272 TraceCheckUtils]: 107: Hoare triple {20506#(and (<= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~x~0) (< main_~y~0 (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20534#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:23:59,404 INFO L290 TraceCheckUtils]: 108: Hoare triple {20534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:23:59,404 INFO L290 TraceCheckUtils]: 109: Hoare triple {20538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20195#false} is VALID [2022-04-15 07:23:59,404 INFO L290 TraceCheckUtils]: 110: Hoare triple {20195#false} assume !false; {20195#false} is VALID [2022-04-15 07:23:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 55 proven. 50 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-04-15 07:23:59,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:24:28,574 INFO L290 TraceCheckUtils]: 110: Hoare triple {20195#false} assume !false; {20195#false} is VALID [2022-04-15 07:24:28,575 INFO L290 TraceCheckUtils]: 109: Hoare triple {20538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20195#false} is VALID [2022-04-15 07:24:28,575 INFO L290 TraceCheckUtils]: 108: Hoare triple {20534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:28,576 INFO L272 TraceCheckUtils]: 107: Hoare triple {20554#(= 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)); {20534#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:24:28,577 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20194#true} {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:24:28,577 INFO L290 TraceCheckUtils]: 105: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,577 INFO L290 TraceCheckUtils]: 104: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,577 INFO L290 TraceCheckUtils]: 103: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,577 INFO L272 TraceCheckUtils]: 102: Hoare triple {20554#(= 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)); {20194#true} is VALID [2022-04-15 07:24:28,586 INFO L290 TraceCheckUtils]: 101: Hoare triple {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:24:28,586 INFO L290 TraceCheckUtils]: 100: Hoare triple {20554#(= 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; {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:24:28,586 INFO L290 TraceCheckUtils]: 99: Hoare triple {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:24:28,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {20582#(= 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; {20554#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 07:24:28,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {20586#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {20582#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:24:28,588 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20194#true} {20586#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} #90#return; {20586#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:24:28,588 INFO L290 TraceCheckUtils]: 95: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,588 INFO L290 TraceCheckUtils]: 94: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,588 INFO L290 TraceCheckUtils]: 93: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,588 INFO L272 TraceCheckUtils]: 92: Hoare triple {20586#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 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)); {20194#true} is VALID [2022-04-15 07:24:28,589 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} {20194#true} #88#return; {20586#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 07:24:28,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:28,589 INFO L290 TraceCheckUtils]: 89: Hoare triple {20614#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:28,590 INFO L290 TraceCheckUtils]: 88: Hoare triple {20194#true} ~cond := #in~cond; {20614#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:24:28,590 INFO L272 TraceCheckUtils]: 87: Hoare triple {20194#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20194#true} {20194#true} #86#return; {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L290 TraceCheckUtils]: 84: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L290 TraceCheckUtils]: 83: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L272 TraceCheckUtils]: 82: Hoare triple {20194#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20194#true} {20194#true} #84#return; {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 78: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L272 TraceCheckUtils]: 77: Hoare triple {20194#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 76: Hoare triple {20194#true} assume !false; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 75: Hoare triple {20194#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20194#true} {20194#true} #90#return; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 73: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 72: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 71: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L272 TraceCheckUtils]: 70: Hoare triple {20194#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)); {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20194#true} {20194#true} #88#return; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L272 TraceCheckUtils]: 65: Hoare triple {20194#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20194#true} {20194#true} #86#return; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L272 TraceCheckUtils]: 60: Hoare triple {20194#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20194#true} {20194#true} #84#return; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L272 TraceCheckUtils]: 55: Hoare triple {20194#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {20194#true} assume !false; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {20194#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20194#true} is VALID [2022-04-15 07:24:28,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {20194#true} assume !false; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {20194#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {20194#true} assume !(~c~0 >= ~b~0); {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {20194#true} {20194#true} #90#return; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L272 TraceCheckUtils]: 45: Hoare triple {20194#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)); {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20194#true} {20194#true} #88#return; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L272 TraceCheckUtils]: 40: Hoare triple {20194#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20194#true} {20194#true} #86#return; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L272 TraceCheckUtils]: 35: Hoare triple {20194#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20194#true} {20194#true} #84#return; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L272 TraceCheckUtils]: 30: Hoare triple {20194#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {20194#true} assume !false; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {20194#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {20194#true} assume !false; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20194#true} {20194#true} #82#return; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L272 TraceCheckUtils]: 22: Hoare triple {20194#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20194#true} {20194#true} #80#return; {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L272 TraceCheckUtils]: 17: Hoare triple {20194#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {20194#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; {20194#true} is VALID [2022-04-15 07:24:28,595 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20194#true} {20194#true} #78#return; {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {20194#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20194#true} {20194#true} #76#return; {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {20194#true} assume !(0 == ~cond); {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {20194#true} ~cond := #in~cond; {20194#true} is VALID [2022-04-15 07:24:28,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {20194#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20194#true} is VALID [2022-04-15 07:24:28,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {20194#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; {20194#true} is VALID [2022-04-15 07:24:28,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {20194#true} call #t~ret6 := main(); {20194#true} is VALID [2022-04-15 07:24:28,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20194#true} {20194#true} #96#return; {20194#true} is VALID [2022-04-15 07:24:28,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {20194#true} assume true; {20194#true} is VALID [2022-04-15 07:24:28,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {20194#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); {20194#true} is VALID [2022-04-15 07:24:28,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {20194#true} call ULTIMATE.init(); {20194#true} is VALID [2022-04-15 07:24:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 07:24:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:24:28,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453628738] [2022-04-15 07:24:28,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:24:28,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927904422] [2022-04-15 07:24:28,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927904422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:24:28,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:24:28,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 22 [2022-04-15 07:24:28,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:24:28,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289779383] [2022-04-15 07:24:28,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289779383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:24:28,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:24:28,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:24:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140255341] [2022-04-15 07:24:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:24:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 111 [2022-04-15 07:24:28,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:24:28,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 07:24:28,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:28,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:24:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:28,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:24:28,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:24:28,682 INFO L87 Difference]: Start difference. First operand 230 states and 307 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 07:24:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:40,623 INFO L93 Difference]: Finished difference Result 260 states and 350 transitions. [2022-04-15 07:24:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:24:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 111 [2022-04-15 07:24:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:24:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 07:24:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 122 transitions. [2022-04-15 07:24:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 07:24:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 122 transitions. [2022-04-15 07:24:40,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 122 transitions. [2022-04-15 07:24:40,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:40,800 INFO L225 Difference]: With dead ends: 260 [2022-04-15 07:24:40,800 INFO L226 Difference]: Without dead ends: 258 [2022-04-15 07:24:40,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:24:40,801 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:24:40,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 07:24:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-15 07:24:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2022-04-15 07:24:41,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:24:41,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 255 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 137 states have internal predecessors, (154), 97 states have call successors, (97), 23 states have call predecessors, (97), 22 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2022-04-15 07:24:41,472 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 255 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 137 states have internal predecessors, (154), 97 states have call successors, (97), 23 states have call predecessors, (97), 22 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2022-04-15 07:24:41,472 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 255 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 137 states have internal predecessors, (154), 97 states have call successors, (97), 23 states have call predecessors, (97), 22 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2022-04-15 07:24:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:41,480 INFO L93 Difference]: Finished difference Result 258 states and 348 transitions. [2022-04-15 07:24:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2022-04-15 07:24:41,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:24:41,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:24:41,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 137 states have internal predecessors, (154), 97 states have call successors, (97), 23 states have call predecessors, (97), 22 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand 258 states. [2022-04-15 07:24:41,482 INFO L87 Difference]: Start difference. First operand has 255 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 137 states have internal predecessors, (154), 97 states have call successors, (97), 23 states have call predecessors, (97), 22 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand 258 states. [2022-04-15 07:24:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:24:41,489 INFO L93 Difference]: Finished difference Result 258 states and 348 transitions. [2022-04-15 07:24:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2022-04-15 07:24:41,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:24:41,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:24:41,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:24:41,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:24:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 137 states have internal predecessors, (154), 97 states have call successors, (97), 23 states have call predecessors, (97), 22 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2022-04-15 07:24:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2022-04-15 07:24:41,498 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 111 [2022-04-15 07:24:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:24:41,499 INFO L478 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2022-04-15 07:24:41,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 07:24:41,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 345 transitions. [2022-04-15 07:24:42,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:24:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2022-04-15 07:24:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 07:24:42,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:24:42,230 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:24:42,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 07:24:42,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:24:42,431 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:24:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:24:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1295483154, now seen corresponding path program 5 times [2022-04-15 07:24:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:24:42,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824024049] [2022-04-15 07:24:42,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:24:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1295483154, now seen corresponding path program 6 times [2022-04-15 07:24:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:24:42,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58400230] [2022-04-15 07:24:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:24:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:24:42,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:24:42,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718179837] [2022-04-15 07:24:42,449 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:24:42,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:24:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:24:42,450 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:24:42,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 07:24:42,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:24:42,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:24:42,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-15 07:24:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:24:42,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:00,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {22445#true} call ULTIMATE.init(); {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {22445#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); {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22445#true} {22445#true} #96#return; {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {22445#true} call #t~ret6 := main(); {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {22445#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; {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {22445#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22445#true} {22445#true} #76#return; {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L272 TraceCheckUtils]: 11: Hoare triple {22445#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22445#true} {22445#true} #78#return; {22445#true} is VALID [2022-04-15 07:25:00,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {22445#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; {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:25:00,078 INFO L272 TraceCheckUtils]: 17: Hoare triple {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,078 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22445#true} {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #80#return; {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:25:00,079 INFO L272 TraceCheckUtils]: 22: Hoare triple {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,079 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22445#true} {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:25:00,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:25:00,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {22498#(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_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,081 INFO L272 TraceCheckUtils]: 30: Hoare triple {22535#(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_~p~0 1) (= 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)); {22445#true} is VALID [2022-04-15 07:25:00,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,082 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22445#true} {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #84#return; {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,082 INFO L272 TraceCheckUtils]: 35: Hoare triple {22535#(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_~p~0 1) (= 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)); {22445#true} is VALID [2022-04-15 07:25:00,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,083 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22445#true} {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,083 INFO L272 TraceCheckUtils]: 40: Hoare triple {22535#(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_~p~0 1) (= 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)); {22445#true} is VALID [2022-04-15 07:25:00,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,084 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {22445#true} {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,084 INFO L272 TraceCheckUtils]: 45: Hoare triple {22535#(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_~p~0 1) (= 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)); {22445#true} is VALID [2022-04-15 07:25:00,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,084 INFO L290 TraceCheckUtils]: 47: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,085 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {22445#true} {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {22535#(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_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {22602#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 07:25:00,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {22602#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {22606#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 07:25:00,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {22606#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} assume !false; {22606#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 07:25:00,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {22606#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 07:25:00,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} assume !false; {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 07:25:00,088 INFO L272 TraceCheckUtils]: 55: Hoare triple {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,088 INFO L290 TraceCheckUtils]: 57: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,088 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22445#true} {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} #84#return; {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 07:25:00,088 INFO L272 TraceCheckUtils]: 60: Hoare triple {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {22445#true} ~cond := #in~cond; {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:00,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:00,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:00,090 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} {22613#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)))} #86#return; {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,090 INFO L272 TraceCheckUtils]: 65: Hoare triple {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,091 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22445#true} {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #88#return; {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,091 INFO L272 TraceCheckUtils]: 70: Hoare triple {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~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)); {22445#true} is VALID [2022-04-15 07:25:00,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,092 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22445#true} {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #90#return; {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {22649#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !false; {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,094 INFO L272 TraceCheckUtils]: 77: Hoare triple {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,094 INFO L290 TraceCheckUtils]: 79: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,094 INFO L290 TraceCheckUtils]: 80: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,095 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22445#true} {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} #84#return; {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,095 INFO L272 TraceCheckUtils]: 82: Hoare triple {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~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)); {22445#true} is VALID [2022-04-15 07:25:00,095 INFO L290 TraceCheckUtils]: 83: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,095 INFO L290 TraceCheckUtils]: 84: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,095 INFO L290 TraceCheckUtils]: 85: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,096 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22445#true} {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} #86#return; {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,096 INFO L272 TraceCheckUtils]: 87: Hoare triple {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:00,096 INFO L290 TraceCheckUtils]: 88: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:25:00,096 INFO L290 TraceCheckUtils]: 89: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:25:00,096 INFO L290 TraceCheckUtils]: 90: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:25:00,097 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {22445#true} {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} #88#return; {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:00,097 INFO L272 TraceCheckUtils]: 92: Hoare triple {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~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)); {22445#true} is VALID [2022-04-15 07:25:00,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {22445#true} ~cond := #in~cond; {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:00,098 INFO L290 TraceCheckUtils]: 94: Hoare triple {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:00,098 INFO L290 TraceCheckUtils]: 95: Hoare triple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:02,102 WARN L284 TraceCheckUtils]: 96: Hoare quadruple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} {22683#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} #90#return; {22747#(and (or (and (not (= main_~q~0 0)) (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~y~0 main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~y~0 main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) 0)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is UNKNOWN [2022-04-15 07:25:02,111 INFO L290 TraceCheckUtils]: 97: Hoare triple {22747#(and (or (and (not (= main_~q~0 0)) (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~y~0 main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~y~0 main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) 0)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {22751#(and (= main_~s~0 0) (= main_~p~0 0) (not (= main_~q~0 0)) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~y~0 main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) main_~q~0) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 07:25:02,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {22751#(and (= main_~s~0 0) (= main_~p~0 0) (not (= main_~q~0 0)) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~q~0 1) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~y~0 main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) main_~q~0) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-15 07:25:02,115 INFO L290 TraceCheckUtils]: 99: Hoare triple {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-15 07:25:02,116 INFO L290 TraceCheckUtils]: 100: Hoare triple {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22762#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (= main_~k~0 0) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-15 07:25:02,117 INFO L290 TraceCheckUtils]: 101: Hoare triple {22762#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (= main_~k~0 0) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {22762#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (= main_~k~0 0) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-15 07:25:02,117 INFO L272 TraceCheckUtils]: 102: Hoare triple {22762#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (= main_~k~0 0) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:02,117 INFO L290 TraceCheckUtils]: 103: Hoare triple {22445#true} ~cond := #in~cond; {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:02,117 INFO L290 TraceCheckUtils]: 104: Hoare triple {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:02,118 INFO L290 TraceCheckUtils]: 105: Hoare triple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:02,119 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} {22762#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (= main_~k~0 0) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} #84#return; {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-15 07:25:02,119 INFO L272 TraceCheckUtils]: 107: Hoare triple {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:25:02,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {22445#true} ~cond := #in~cond; {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:02,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {22638#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:02,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:25:02,125 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} {22755#(and (= main_~r~0 0) (not (= main_~p~0 0)) (= (+ main_~s~0 main_~r~0) 1) (not (<= (* main_~a~0 2) main_~y~0)) (< main_~x~0 main_~y~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= main_~p~0 1) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) (* main_~a~0 main_~y~0) (* main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~y~0 main_~r~0)) main_~p~0) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} #86#return; {22796#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} is VALID [2022-04-15 07:25:02,126 INFO L272 TraceCheckUtils]: 112: Hoare triple {22796#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:25:02,126 INFO L290 TraceCheckUtils]: 113: Hoare triple {22800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:02,126 INFO L290 TraceCheckUtils]: 114: Hoare triple {22804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22446#false} is VALID [2022-04-15 07:25:02,126 INFO L290 TraceCheckUtils]: 115: Hoare triple {22446#false} assume !false; {22446#false} is VALID [2022-04-15 07:25:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 129 proven. 56 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 07:25:02,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:28:54,526 WARN L855 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~xy~0_BEFORE_CALL_31 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (let ((.cse1 (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131))))) (let ((.cse0 (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) .cse1))) (or (= (mod .cse0 v_main_~q~0_BEFORE_CALL_128) 0) (not (= (+ (* (- 1) .cse1) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)) (= .cse0 0)))))) is different from true [2022-04-15 07:29:47,597 INFO L290 TraceCheckUtils]: 115: Hoare triple {22446#false} assume !false; {22446#false} is VALID [2022-04-15 07:29:47,598 INFO L290 TraceCheckUtils]: 114: Hoare triple {22804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22446#false} is VALID [2022-04-15 07:29:47,598 INFO L290 TraceCheckUtils]: 113: Hoare triple {22800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:29:47,599 INFO L272 TraceCheckUtils]: 112: Hoare triple {22820#(= 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)); {22800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:29:47,600 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #86#return; {22820#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 07:29:47,600 INFO L290 TraceCheckUtils]: 110: Hoare triple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:47,600 INFO L290 TraceCheckUtils]: 109: Hoare triple {22834#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:47,601 INFO L290 TraceCheckUtils]: 108: Hoare triple {22445#true} ~cond := #in~cond; {22834#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:29:47,601 INFO L272 TraceCheckUtils]: 107: Hoare triple {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:47,601 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {22445#true} {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #84#return; {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 07:29:47,601 INFO L290 TraceCheckUtils]: 105: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:47,602 INFO L290 TraceCheckUtils]: 104: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:47,602 INFO L290 TraceCheckUtils]: 103: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:47,602 INFO L272 TraceCheckUtils]: 102: Hoare triple {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:47,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 07:29:47,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 07:29:47,603 INFO L290 TraceCheckUtils]: 99: Hoare triple {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 07:29:47,623 INFO L290 TraceCheckUtils]: 98: Hoare triple {22865#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {22824#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 07:29:47,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {22869#(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)))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {22865#(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-15 07:29:49,628 WARN L284 TraceCheckUtils]: 96: Hoare quadruple {22877#(forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (and (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= 0 v_main_~q~0_BEFORE_CALL_128))) (and (or (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0))) (not (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)))) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0)))} {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #90#return; {22869#(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)))) (<= main_~b~0 main_~c~0))} is UNKNOWN [2022-04-15 07:29:51,632 WARN L290 TraceCheckUtils]: 95: Hoare triple {22877#(forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (and (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= 0 v_main_~q~0_BEFORE_CALL_128))) (and (or (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0))) (not (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)))) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0)))} assume true; {22877#(forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (and (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= 0 v_main_~q~0_BEFORE_CALL_128))) (and (or (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0))) (not (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)))) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0)))} is UNKNOWN [2022-04-15 07:29:53,635 WARN L290 TraceCheckUtils]: 94: Hoare triple {22884#(or (forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (and (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= 0 v_main_~q~0_BEFORE_CALL_128))) (and (or (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0))) (not (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)))) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0))) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22877#(forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (and (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= 0 v_main_~q~0_BEFORE_CALL_128))) (and (or (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0))) (not (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)))) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0)))} is UNKNOWN [2022-04-15 07:29:55,638 WARN L290 TraceCheckUtils]: 93: Hoare triple {22888#(or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~xy~0_BEFORE_CALL_31 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0))))} ~cond := #in~cond; {22884#(or (forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (and (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= 0 v_main_~q~0_BEFORE_CALL_128))) (and (or (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0))) (not (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~xy~0_BEFORE_CALL_31 Int)) (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)))) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0))) (= __VERIFIER_assert_~cond 0))} is UNKNOWN [2022-04-15 07:29:57,641 WARN L272 TraceCheckUtils]: 92: Hoare triple {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~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)); {22888#(or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~q~0_BEFORE_CALL_128 Int) (v_main_~xy~0_BEFORE_CALL_31 Int) (v_main_~s~0_BEFORE_CALL_131 Int) (v_main_~yy~0_BEFORE_CALL_41 Int) (v_main_~x~0_BEFORE_CALL_166 Int) (v_main_~y~0_BEFORE_CALL_171 Int)) (or (= (mod (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) v_main_~q~0_BEFORE_CALL_128) 0) (not (= (+ (* (- 1) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) (* v_main_~xy~0_BEFORE_CALL_31 v_main_~q~0_BEFORE_CALL_128) (* v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131)) 0)) (= (+ (* (- 1) v_main_~yy~0_BEFORE_CALL_41 v_main_~s~0_BEFORE_CALL_131) (* v_main_~y~0_BEFORE_CALL_171 (+ (* v_main_~x~0_BEFORE_CALL_166 v_main_~q~0_BEFORE_CALL_128) (* v_main_~y~0_BEFORE_CALL_171 v_main_~s~0_BEFORE_CALL_131)))) 0))))} is UNKNOWN [2022-04-15 07:29:57,642 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {22445#true} {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #88#return; {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,643 INFO L290 TraceCheckUtils]: 90: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,643 INFO L290 TraceCheckUtils]: 89: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,643 INFO L290 TraceCheckUtils]: 88: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,643 INFO L272 TraceCheckUtils]: 87: Hoare triple {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,644 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22445#true} {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #86#return; {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,644 INFO L290 TraceCheckUtils]: 83: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,644 INFO L272 TraceCheckUtils]: 82: Hoare triple {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,645 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22445#true} {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #84#return; {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,645 INFO L272 TraceCheckUtils]: 77: Hoare triple {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} assume !false; {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22873#(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)))) (<= main_~b~0 main_~c~0) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,720 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22445#true} {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #90#return; {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,721 INFO L272 TraceCheckUtils]: 70: Hoare triple {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~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)); {22445#true} is VALID [2022-04-15 07:29:57,721 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22445#true} {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #88#return; {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,722 INFO L272 TraceCheckUtils]: 65: Hoare triple {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,723 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #86#return; {22940#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:57,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {22834#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:57,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {22445#true} ~cond := #in~cond; {22834#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:29:57,724 INFO L272 TraceCheckUtils]: 60: Hoare triple {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,725 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22445#true} {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} #84#return; {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,725 INFO L272 TraceCheckUtils]: 55: Hoare triple {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} assume !false; {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {22445#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22974#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (and (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) 0)) (or (not (= (mod (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) main_~b~0) (* (- 1) main_~s~0 main_~yy~0) (* main_~y~0 main_~s~0)) main_~q~0) 0)) (= main_~q~0 0))))} is VALID [2022-04-15 07:29:57,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {22445#true} assume !false; {22445#true} is VALID [2022-04-15 07:29:57,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {22445#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {22445#true} is VALID [2022-04-15 07:29:57,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {22445#true} assume !(~c~0 >= ~b~0); {22445#true} is VALID [2022-04-15 07:29:57,728 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {22445#true} {22445#true} #90#return; {22445#true} is VALID [2022-04-15 07:29:57,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L272 TraceCheckUtils]: 45: Hoare triple {22445#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)); {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {22445#true} {22445#true} #88#return; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L272 TraceCheckUtils]: 40: Hoare triple {22445#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22445#true} {22445#true} #86#return; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,729 INFO L272 TraceCheckUtils]: 35: Hoare triple {22445#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22445#true} {22445#true} #84#return; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L272 TraceCheckUtils]: 30: Hoare triple {22445#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {22445#true} assume !false; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {22445#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {22445#true} assume !false; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22445#true} {22445#true} #82#return; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L272 TraceCheckUtils]: 22: Hoare triple {22445#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22445#true} {22445#true} #80#return; {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L272 TraceCheckUtils]: 17: Hoare triple {22445#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {22445#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; {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22445#true} {22445#true} #78#return; {22445#true} is VALID [2022-04-15 07:29:57,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L272 TraceCheckUtils]: 11: Hoare triple {22445#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22445#true} {22445#true} #76#return; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {22445#true} assume !(0 == ~cond); {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {22445#true} ~cond := #in~cond; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {22445#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {22445#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; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {22445#true} call #t~ret6 := main(); {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22445#true} {22445#true} #96#return; {22445#true} is VALID [2022-04-15 07:29:57,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {22445#true} assume true; {22445#true} is VALID [2022-04-15 07:29:57,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {22445#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); {22445#true} is VALID [2022-04-15 07:29:57,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {22445#true} call ULTIMATE.init(); {22445#true} is VALID [2022-04-15 07:29:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 137 proven. 38 refuted. 5 times theorem prover too weak. 272 trivial. 1 not checked. [2022-04-15 07:29:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:29:57,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58400230] [2022-04-15 07:29:57,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:29:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718179837] [2022-04-15 07:29:57,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718179837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:29:57,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:29:57,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2022-04-15 07:29:57,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:29:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824024049] [2022-04-15 07:29:57,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824024049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:29:57,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:29:57,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:29:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211434361] [2022-04-15 07:29:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:29:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) Word has length 116 [2022-04-15 07:29:57,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:29:57,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-15 07:29:59,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 70 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:29:59,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:29:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:29:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:29:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=641, Unknown=9, NotChecked=52, Total=812 [2022-04-15 07:29:59,979 INFO L87 Difference]: Start difference. First operand 255 states and 345 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19)