/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:47:44,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:47:44,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:47:44,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:47:44,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:47:44,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:47:44,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:47:44,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:47:44,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:47:44,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:47:44,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:47:44,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:47:44,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:47:44,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:47:44,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:47:44,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:47:44,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:47:44,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:47:44,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:47:44,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:47:44,688 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:47:44,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:47:44,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:47:44,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:47:44,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:47:44,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:47:44,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:47:44,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:47:44,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:47:44,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:47:44,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:47:44,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:47:44,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:47:44,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:47:44,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:47:44,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:47:44,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:47:44,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:47:44,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:47:44,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:47:44,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:47:44,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:47:44,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:47:44,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:47:44,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:47:44,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:47:44,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:47:44,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:47:44,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:47:44,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:47:44,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:47:44,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:47:44,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:47:44,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:47:44,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:47:44,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:47:44,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:47:44,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:47:44,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:47:44,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:47:44,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:47:44,714 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:47:44,714 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:47:44,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:47:44,714 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:47:44,714 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 14:47:44,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:47:44,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:47:44,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:47:44,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:47:44,899 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:47:44,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-15 14:47:44,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a998693c/0515fb3596c047eb94a2fba35312e6f8/FLAG68c81010f [2022-04-15 14:47:45,290 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:47:45,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-15 14:47:45,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a998693c/0515fb3596c047eb94a2fba35312e6f8/FLAG68c81010f [2022-04-15 14:47:45,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a998693c/0515fb3596c047eb94a2fba35312e6f8 [2022-04-15 14:47:45,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:47:45,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:47:45,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:47:45,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:47:45,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:47:45,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a94bcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45, skipping insertion in model container [2022-04-15 14:47:45,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:47:45,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:47:45,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c[490,503] [2022-04-15 14:47:45,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:47:45,533 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:47:45,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c[490,503] [2022-04-15 14:47:45,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:47:45,558 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:47:45,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45 WrapperNode [2022-04-15 14:47:45,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:47:45,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:47:45,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:47:45,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:47:45,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:47:45,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:47:45,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:47:45,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:47:45,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (1/1) ... [2022-04-15 14:47:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:47:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:45,621 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 14:47:45,630 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 14:47:45,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:47:45,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:47:45,659 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:47:45,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:47:45,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:47:45,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:47:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:47:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:47:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:47:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:47:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 14:47:45,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:47:45,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:47:45,661 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:47:45,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:47:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:47:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:47:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:47:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:47:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:47:45,722 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:47:45,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:47:45,883 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:47:45,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:47:45,888 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:47:45,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:47:45 BoogieIcfgContainer [2022-04-15 14:47:45,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:47:45,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:47:45,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:47:45,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:47:45,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:47:45" (1/3) ... [2022-04-15 14:47:45,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cbd7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:47:45, skipping insertion in model container [2022-04-15 14:47:45,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:47:45" (2/3) ... [2022-04-15 14:47:45,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cbd7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:47:45, skipping insertion in model container [2022-04-15 14:47:45,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:47:45" (3/3) ... [2022-04-15 14:47:45,899 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound5.c [2022-04-15 14:47:45,902 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:47:45,902 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:47:45,938 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:47:45,942 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 14:47:45,943 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:47:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 14:47:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 14:47:45,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:45,965 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 14:47:45,965 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-15 14:47:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:45,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213235947] [2022-04-15 14:47:45,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-15 14:47:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:45,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996204367] [2022-04-15 14:47:45,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:47:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 14:47:46,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 14:47:46,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 14:47:46,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:47:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 14:47:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:47:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 14:47:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 14:47:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 14:47:46,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 14:47:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-15 14:47:46,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:47:46,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 14:47:46,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 14:47:46,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 14:47:46,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-15 14:47:46,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-15 14:47:46,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:47:46,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 14:47:46,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:47:46,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,158 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 14:47:46,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-15 14:47:46,158 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-15 14:47:46,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,159 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 14:47:46,159 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-15 14:47:46,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:47:46,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:47:46,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:47:46,160 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-15 14:47:46,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 14:47:46,160 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-15 14:47:46,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-15 14:47:46,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-15 14:47:46,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 14:47:46,161 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 14:47:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:46,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996204367] [2022-04-15 14:47:46,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996204367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:46,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:46,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:47:46,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:46,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213235947] [2022-04-15 14:47:46,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213235947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:46,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:46,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:47:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561090825] [2022-04-15 14:47:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:46,169 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 14:47:46,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:46,174 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 14:47:46,198 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 14:47:46,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:47:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:47:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:47:46,214 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:46,428 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-15 14:47:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:47:46,429 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 14:47:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:46,430 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 14:47:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-15 14:47:46,437 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 14:47:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-15 14:47:46,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-15 14:47:46,536 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 14:47:46,545 INFO L225 Difference]: With dead ends: 72 [2022-04-15 14:47:46,545 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:47:46,548 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 14:47:46,552 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:47:46,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:47:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:47:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 14:47:46,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:46,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:46,584 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:46,585 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:46,598 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 14:47:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 14:47:46,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:46,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:46,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 14:47:46,601 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 14:47:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:46,607 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 14:47:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 14:47:46,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:46,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:46,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:46,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-15 14:47:46,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-15 14:47:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:46,614 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-15 14:47:46,615 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 14:47:46,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-15 14:47:46,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 14:47:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 14:47:46,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:46,655 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 14:47:46,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:47:46,655 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-15 14:47:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:46,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60964601] [2022-04-15 14:47:46,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-15 14:47:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:46,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687015561] [2022-04-15 14:47:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:46,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:46,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094494619] [2022-04-15 14:47:46,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:46,695 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 14:47:46,725 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 14:47:46,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:47:46,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:46,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:47:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:46,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:47,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-15 14:47:47,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,034 INFO L272 TraceCheckUtils]: 11: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,037 INFO L272 TraceCheckUtils]: 17: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,038 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,042 INFO L272 TraceCheckUtils]: 22: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,044 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:47,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {435#(<= |main_#t~post6| 0)} is VALID [2022-04-15 14:47:47,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {349#false} is VALID [2022-04-15 14:47:47,045 INFO L272 TraceCheckUtils]: 29: Hoare triple {349#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {349#false} is VALID [2022-04-15 14:47:47,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-15 14:47:47,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-15 14:47:47,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-15 14:47:47,047 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 14:47:47,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:47:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:47,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687015561] [2022-04-15 14:47:47,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:47:47,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094494619] [2022-04-15 14:47:47,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094494619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:47,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:47,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:47:47,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:47,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60964601] [2022-04-15 14:47:47,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60964601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:47,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:47,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:47:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420280503] [2022-04-15 14:47:47,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 14:47:47,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:47,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:47,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:47,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:47:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:47:47,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:47:47,073 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:47,167 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-15 14:47:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:47:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 14:47:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-15 14:47:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-15 14:47:47,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-15 14:47:47,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:47,216 INFO L225 Difference]: With dead ends: 44 [2022-04-15 14:47:47,216 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 14:47:47,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:47:47,219 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:47:47,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:47:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 14:47:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 14:47:47,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:47,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:47,243 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:47,244 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:47,250 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 14:47:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 14:47:47,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:47,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:47,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 14:47:47,257 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 14:47:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:47,260 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 14:47:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 14:47:47,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:47,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:47,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:47,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-15 14:47:47,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-15 14:47:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:47,269 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-15 14:47:47,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:47,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-15 14:47:47,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 14:47:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:47:47,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:47,307 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 14:47:47,323 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 14:47:47,519 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 14:47:47,519 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:47,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-15 14:47:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:47,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1188713656] [2022-04-15 14:47:47,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-15 14:47:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:47,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484875853] [2022-04-15 14:47:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:47,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:47,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694128127] [2022-04-15 14:47:47,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:47,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:47,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:47,539 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 14:47:47,540 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 14:47:47,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:47:47,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:47,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:47:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:47,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:47,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-15 14:47:47,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {682#true} is VALID [2022-04-15 14:47:47,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-15 14:47:47,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-15 14:47:47,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#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; {682#true} is VALID [2022-04-15 14:47:47,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:47:47,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:47:47,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-15 14:47:47,718 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:47:47,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:47,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:47,720 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-15 14:47:47,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 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; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,720 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:47:47,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:47:47,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,721 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:47:47,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:47:47,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,722 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-15 14:47:47,724 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-15 14:47:47,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-15 14:47:47,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-15 14:47:47,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-15 14:47:47,724 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 14:47:47,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:47:47,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-15 14:47:47,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-15 14:47:47,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-15 14:47:47,940 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-15 14:47:47,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-15 14:47:47,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,944 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:47:47,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:47:47,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,945 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:47:47,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:47:47,946 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 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; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:47:47,947 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-15 14:47:47,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:47,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:47,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 14:47:47,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-15 14:47:47,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:47:47,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:47:47,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:47:47,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#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; {682#true} is VALID [2022-04-15 14:47:47,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-15 14:47:47,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-15 14:47:47,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:47:47,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {682#true} is VALID [2022-04-15 14:47:47,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-15 14:47:47,950 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 14:47:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:47,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484875853] [2022-04-15 14:47:47,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:47:47,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694128127] [2022-04-15 14:47:47,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694128127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:47:47,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:47:47,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 14:47:47,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:47,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1188713656] [2022-04-15 14:47:47,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1188713656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:47,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:47,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:47:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320798740] [2022-04-15 14:47:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:47:47,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:47,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:47:47,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:47,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:47:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:47:47,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:47:47,970 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:47:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:48,218 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-15 14:47:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:47:48,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:47:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:47:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 14:47:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:47:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 14:47:48,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-15 14:47:48,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:48,276 INFO L225 Difference]: With dead ends: 53 [2022-04-15 14:47:48,276 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:47:48,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:47:48,278 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:47:48,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:47:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:47:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-15 14:47:48,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:48,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:48,301 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:48,301 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:48,303 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-15 14:47:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 14:47:48,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:48,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:48,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-15 14:47:48,304 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-15 14:47:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:48,306 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-15 14:47:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 14:47:48,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:48,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:48,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:48,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:47:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-15 14:47:48,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-15 14:47:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:48,309 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-15 14:47:48,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:47:48,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-15 14:47:48,349 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 14:47:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-15 14:47:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 14:47:48,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:48,350 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, 1, 1] [2022-04-15 14:47:48,373 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 14:47:48,567 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 14:47:48,567 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-15 14:47:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:48,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503167263] [2022-04-15 14:47:48,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-15 14:47:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:48,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811435215] [2022-04-15 14:47:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:48,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:48,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702527557] [2022-04-15 14:47:48,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:48,603 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 14:47:48,604 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 14:47:48,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:47:48,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:48,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 14:47:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:48,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:48,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-15 14:47:48,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1166#true} is VALID [2022-04-15 14:47:48,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 14:47:48,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-15 14:47:48,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-15 14:47:48,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1166#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; {1166#true} is VALID [2022-04-15 14:47:48,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {1166#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-15 14:47:48,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 14:47:48,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 14:47:48,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L272 TraceCheckUtils]: 11: Hoare triple {1166#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {1166#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; {1166#true} is VALID [2022-04-15 14:47:48,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {1166#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L272 TraceCheckUtils]: 22: Hoare triple {1166#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 14:47:48,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 14:47:48,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 14:47:48,766 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-15 14:47:48,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-15 14:47:48,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 5);havoc #t~post6; {1166#true} is VALID [2022-04-15 14:47:48,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {1166#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 14:47:48,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 14:47:48,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !!(#t~post7 < 5);havoc #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-15 14:47:48,769 INFO L272 TraceCheckUtils]: 32: Hoare triple {1258#(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)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:47:48,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:48,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-15 14:47:48,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-15 14:47:48,771 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 14:47:48,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:47:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811435215] [2022-04-15 14:47:48,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:47:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702527557] [2022-04-15 14:47:48,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702527557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:48,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:48,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:47:48,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1503167263] [2022-04-15 14:47:48,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1503167263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:48,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:48,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:47:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129711347] [2022-04-15 14:47:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-15 14:47:48,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:48,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:47:48,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:48,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:47:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:47:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:47:48,790 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:47:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:48,972 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-15 14:47:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:47:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-15 14:47:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:47:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 14:47:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:47:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 14:47:48,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 14:47:49,023 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 14:47:49,024 INFO L225 Difference]: With dead ends: 51 [2022-04-15 14:47:49,024 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 14:47:49,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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 14:47:49,025 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 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 14:47:49,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:47:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 14:47:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-15 14:47:49,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:49,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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 14:47:49,054 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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 14:47:49,054 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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 14:47:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:49,060 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-15 14:47:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 14:47:49,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:49,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:49,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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 49 states. [2022-04-15 14:47:49,062 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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 49 states. [2022-04-15 14:47:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:49,064 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-15 14:47:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 14:47:49,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:49,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:49,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:49,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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 14:47:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-15 14:47:49,066 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-15 14:47:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:49,066 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-15 14:47:49,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:47:49,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-15 14:47:49,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-15 14:47:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 14:47:49,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:49,107 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 14:47:49,123 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 14:47:49,315 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 14:47:49,316 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-15 14:47:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:49,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993372513] [2022-04-15 14:47:49,316 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-15 14:47:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:49,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196579577] [2022-04-15 14:47:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:49,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:49,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184966634] [2022-04-15 14:47:49,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:49,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:49,336 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 14:47:49,337 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 14:47:49,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:47:49,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:49,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:47:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:49,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:49,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-15 14:47:49,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,518 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #78#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,518 INFO L272 TraceCheckUtils]: 11: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,520 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #80#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {1576#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,520 INFO L272 TraceCheckUtils]: 17: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,522 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #82#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,522 INFO L272 TraceCheckUtils]: 22: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,523 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #84#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 14:47:49,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-15 14:47:49,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {1655#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-15 14:47:49,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {1655#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1655#(<= ~counter~0 1)} is VALID [2022-04-15 14:47:49,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {1655#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1665#(<= |main_#t~post7| 1)} is VALID [2022-04-15 14:47:49,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {1665#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1569#false} is VALID [2022-04-15 14:47:49,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {1569#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; {1569#false} is VALID [2022-04-15 14:47:49,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-15 14:47:49,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 5);havoc #t~post6; {1569#false} is VALID [2022-04-15 14:47:49,525 INFO L272 TraceCheckUtils]: 35: Hoare triple {1569#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1569#false} is VALID [2022-04-15 14:47:49,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-15 14:47:49,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-15 14:47:49,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-15 14:47:49,526 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 14:47:49,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:47:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196579577] [2022-04-15 14:47:49,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:47:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184966634] [2022-04-15 14:47:49,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184966634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:49,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:49,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:47:49,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993372513] [2022-04-15 14:47:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993372513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:49,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:49,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:47:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521322164] [2022-04-15 14:47:49,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-15 14:47:49,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:49,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:49,547 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 14:47:49,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:47:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:47:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:47:49,548 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:49,671 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-15 14:47:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:47:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-15 14:47:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 14:47:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 14:47:49,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-15 14:47:49,717 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 14:47:49,718 INFO L225 Difference]: With dead ends: 72 [2022-04-15 14:47:49,718 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 14:47:49,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:47:49,722 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:47:49,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:47:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 14:47:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 14:47:49,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:49,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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 14:47:49,756 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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 14:47:49,756 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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 14:47:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:49,758 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-15 14:47:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-15 14:47:49,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:49,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:49,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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 46 states. [2022-04-15 14:47:49,758 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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 46 states. [2022-04-15 14:47:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:49,760 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-15 14:47:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-15 14:47:49,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:49,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:49,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:49,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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 14:47:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-15 14:47:49,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-15 14:47:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:49,763 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-15 14:47:49,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:47:49,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-15 14:47:49,803 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 14:47:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-15 14:47:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 14:47:49,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:49,803 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, 1, 1] [2022-04-15 14:47:49,822 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 14:47:50,019 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 14:47:50,019 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-15 14:47:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054669295] [2022-04-15 14:47:50,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-15 14:47:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110453383] [2022-04-15 14:47:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:50,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:50,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683416112] [2022-04-15 14:47:50,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:50,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:50,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:50,031 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 14:47:50,032 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 14:47:50,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:47:50,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:50,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 14:47:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:50,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:50,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#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; {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-15 14:47:50,315 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-15 14:47:50,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:47:50,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:50,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:50,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} {2017#true} #80#return; {2069#(<= 1 main_~y~0)} is VALID [2022-04-15 14:47:50,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(<= 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; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {2073#(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)); {2017#true} is VALID [2022-04-15 14:47:50,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,324 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,324 INFO L272 TraceCheckUtils]: 22: Hoare triple {2073#(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)); {2017#true} is VALID [2022-04-15 14:47:50,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {2073#(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; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,328 INFO L272 TraceCheckUtils]: 32: Hoare triple {2073#(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)); {2017#true} is VALID [2022-04-15 14:47:50,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,329 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:47:50,330 INFO L272 TraceCheckUtils]: 37: Hoare triple {2073#(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)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:47:50,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:50,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-15 14:47:50,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-15 14:47:50,331 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 14:47:50,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:47:50,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-15 14:47:50,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-15 14:47:50,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:50,526 INFO L272 TraceCheckUtils]: 37: Hoare triple {2157#(= 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)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:47:50,527 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,527 INFO L272 TraceCheckUtils]: 32: Hoare triple {2157#(= 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)); {2017#true} is VALID [2022-04-15 14:47:50,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {2157#(= 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; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,530 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,530 INFO L272 TraceCheckUtils]: 22: Hoare triple {2157#(= 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)); {2017#true} is VALID [2022-04-15 14:47:50,531 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,531 INFO L272 TraceCheckUtils]: 17: Hoare triple {2157#(= 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)); {2017#true} is VALID [2022-04-15 14:47:50,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#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; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:47:50,531 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-15 14:47:50,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#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; {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-15 14:47:50,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-15 14:47:50,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 14:47:50,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2017#true} is VALID [2022-04-15 14:47:50,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-15 14:47:50,533 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 14:47:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110453383] [2022-04-15 14:47:50,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:47:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683416112] [2022-04-15 14:47:50,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683416112] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 14:47:50,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:47:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 14:47:50,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054669295] [2022-04-15 14:47:50,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054669295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:50,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:50,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:47:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889071263] [2022-04-15 14:47:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-15 14:47:50,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:50,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:47:50,554 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 14:47:50,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:47:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:47:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:47:50,555 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:47:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:50,743 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-15 14:47:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:47:50,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-15 14:47:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:47:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:47:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:47:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:47:50,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 14:47:50,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:50,794 INFO L225 Difference]: With dead ends: 61 [2022-04-15 14:47:50,794 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 14:47:50,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:47:50,794 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:47:50,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:47:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 14:47:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-15 14:47:50,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:50,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 14:47:50,840 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 14:47:50,841 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 14:47:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:50,843 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-15 14:47:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-15 14:47:50,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:50,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:50,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 59 states. [2022-04-15 14:47:50,843 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 59 states. [2022-04-15 14:47:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:50,845 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-15 14:47:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-15 14:47:50,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:50,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:50,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:50,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 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 14:47:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-15 14:47:50,848 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-15 14:47:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:50,848 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-15 14:47:50,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:47:50,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-15 14:47:50,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-15 14:47:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 14:47:50,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:50,911 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, 1, 1] [2022-04-15 14:47:50,939 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 14:47:51,117 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 14:47:51,117 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-15 14:47:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:51,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427678739] [2022-04-15 14:47:51,118 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-15 14:47:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:51,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023236122] [2022-04-15 14:47:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:51,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:51,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502827417] [2022-04-15 14:47:51,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:51,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:51,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:51,152 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 14:47:51,153 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 14:47:51,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:47:51,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:51,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 14:47:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:51,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:51,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-15 14:47:51,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2629#true} is VALID [2022-04-15 14:47:51,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-15 14:47:51,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-15 14:47:51,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#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; {2629#true} is VALID [2022-04-15 14:47:51,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-15 14:47:51,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:47:51,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:51,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:47:51,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} {2629#true} #78#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-15 14:47:51,453 INFO L272 TraceCheckUtils]: 11: Hoare triple {2666#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-15 14:47:51,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,454 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2666#(<= 1 main_~x~0)} #80#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-15 14:47:51,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {2666#(<= 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; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,454 INFO L272 TraceCheckUtils]: 17: Hoare triple {2685#(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)); {2629#true} is VALID [2022-04-15 14:47:51,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,456 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,456 INFO L272 TraceCheckUtils]: 22: Hoare triple {2685#(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)); {2629#true} is VALID [2022-04-15 14:47:51,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,457 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {2685#(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; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,459 INFO L272 TraceCheckUtils]: 32: Hoare triple {2685#(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)); {2629#true} is VALID [2022-04-15 14:47:51,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,460 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,461 INFO L272 TraceCheckUtils]: 37: Hoare triple {2685#(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)); {2629#true} is VALID [2022-04-15 14:47:51,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,462 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 14:47:51,462 INFO L272 TraceCheckUtils]: 42: Hoare triple {2685#(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)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:47:51,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:51,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-15 14:47:51,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-15 14:47:51,463 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 14:47:51,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:47:51,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-15 14:47:51,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-15 14:47:51,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:51,665 INFO L272 TraceCheckUtils]: 42: Hoare triple {2784#(= 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)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:47:51,666 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,666 INFO L272 TraceCheckUtils]: 37: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-15 14:47:51,667 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,667 INFO L272 TraceCheckUtils]: 32: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-15 14:47:51,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {2784#(= 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; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,670 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,670 INFO L272 TraceCheckUtils]: 22: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-15 14:47:51,676 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,676 INFO L272 TraceCheckUtils]: 17: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#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; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:47:51,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {2629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#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; {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2629#true} is VALID [2022-04-15 14:47:51,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-15 14:47:51,678 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 14:47:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:47:51,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023236122] [2022-04-15 14:47:51,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:47:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502827417] [2022-04-15 14:47:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502827417] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 14:47:51,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:47:51,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 14:47:51,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:47:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427678739] [2022-04-15 14:47:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427678739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:47:51,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:47:51,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:47:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129470873] [2022-04-15 14:47:51,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:47:51,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-15 14:47:51,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:47:51,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:47:51,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:51,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:47:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:47:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:47:51,705 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:47:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:51,913 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-15 14:47:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:47:51,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-15 14:47:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:47:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:47:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:47:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:47:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:47:51,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 14:47:51,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:51,980 INFO L225 Difference]: With dead ends: 65 [2022-04-15 14:47:51,980 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 14:47:51,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:47:51,981 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:47:51,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:47:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 14:47:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-15 14:47:52,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:47:52,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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 14:47:52,030 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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 14:47:52,030 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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 14:47:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:52,033 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 14:47:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-15 14:47:52,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:52,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:52,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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 63 states. [2022-04-15 14:47:52,033 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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 63 states. [2022-04-15 14:47:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:47:52,035 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 14:47:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-15 14:47:52,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:47:52,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:47:52,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:47:52,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:47:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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 14:47:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-15 14:47:52,038 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-15 14:47:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:47:52,038 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-15 14:47:52,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:47:52,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-15 14:47:52,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:47:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-15 14:47:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 14:47:52,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:47:52,109 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, 1, 1] [2022-04-15 14:47:52,127 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 14:47:52,318 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 14:47:52,319 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:47:52,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:47:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-15 14:47:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:47:52,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778248812] [2022-04-15 14:47:52,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:47:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-15 14:47:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:47:52,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801488097] [2022-04-15 14:47:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:47:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:47:52,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:47:52,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922366551] [2022-04-15 14:47:52,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:47:52,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:47:52,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:47:52,331 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 14:47:52,332 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 14:47:52,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:47:52,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:47:52,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 14:47:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:47:52,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:47:52,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-15 14:47:52,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3295#true} is VALID [2022-04-15 14:47:52,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 14:47:52,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-15 14:47:52,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-15 14:47:52,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {3295#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; {3295#true} is VALID [2022-04-15 14:47:52,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {3295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L272 TraceCheckUtils]: 11: Hoare triple {3295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 14:47:52,629 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-15 14:47:52,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#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; {3348#(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 14:47:52,630 INFO L272 TraceCheckUtils]: 17: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-15 14:47:52,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 14:47:52,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 14:47:52,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 14:47:52,630 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#true} {3348#(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; {3348#(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 14:47:52,631 INFO L272 TraceCheckUtils]: 22: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-15 14:47:52,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 14:47:52,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 14:47:52,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 14:47:52,631 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3295#true} {3348#(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; {3348#(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 14:47:52,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3348#(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 14:47:52,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {3348#(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 !!(#t~post6 < 5);havoc #t~post6; {3348#(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 14:47:52,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {3348#(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; {3348#(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 14:47:52,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3348#(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 14:47:52,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {3348#(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 !!(#t~post7 < 5);havoc #t~post7; {3348#(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 14:47:52,633 INFO L272 TraceCheckUtils]: 32: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-15 14:47:52,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 14:47:52,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 14:47:52,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 14:47:52,635 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3295#true} {3348#(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; {3348#(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 14:47:52,636 INFO L272 TraceCheckUtils]: 37: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-15 14:47:52,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:52,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:47:52,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:47:52,637 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(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; {3348#(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 14:47:52,637 INFO L272 TraceCheckUtils]: 42: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-15 14:47:52,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:52,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:47:52,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:47:52,638 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #90#return; {3348#(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 14:47:52,639 INFO L272 TraceCheckUtils]: 47: Hoare triple {3348#(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)); {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:47:52,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:47:52,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-15 14:47:52,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-15 14:47:52,640 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 14:47:52,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:48:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:48:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801488097] [2022-04-15 14:48:51,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:48:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922366551] [2022-04-15 14:48:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922366551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:48:51,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:48:51,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 14:48:51,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:48:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778248812] [2022-04-15 14:48:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778248812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:48:51,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:48:51,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:48:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210707476] [2022-04-15 14:48:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:48:51,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 51 [2022-04-15 14:48:51,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:48:51,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 14:48:51,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:48:51,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:48:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:48:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:48:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:48:51,633 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 14:48:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:48:52,007 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-15 14:48:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:48:52,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 51 [2022-04-15 14:48:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:48:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 14:48:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 14:48:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 14:48:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 14:48:52,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-15 14:48:52,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:48:52,060 INFO L225 Difference]: With dead ends: 69 [2022-04-15 14:48:52,060 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 14:48:52,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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 14:48:52,061 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:48:52,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 160 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:48:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 14:48:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-15 14:48:52,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:48:52,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 14:48:52,113 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 14:48:52,113 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 14:48:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:48:52,115 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-15 14:48:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-15 14:48:52,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:48:52,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:48:52,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 67 states. [2022-04-15 14:48:52,121 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 67 states. [2022-04-15 14:48:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:48:52,123 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-15 14:48:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-15 14:48:52,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:48:52,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:48:52,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:48:52,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:48:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 14:48:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-15 14:48:52,125 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-15 14:48:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:48:52,125 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-15 14:48:52,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 14:48:52,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-15 14:48:52,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:48:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-15 14:48:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 14:48:52,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:48:52,207 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:48:52,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 14:48:52,407 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 14:48:52,409 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:48:52,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:48:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-15 14:48:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:48:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472205585] [2022-04-15 14:48:52,410 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:48:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-15 14:48:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:48:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387007457] [2022-04-15 14:48:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:48:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:48:52,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:48:52,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440527069] [2022-04-15 14:48:52,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:48:52,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:48:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:48:52,423 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 14:48:52,423 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 14:48:52,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:48:52,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:48:52,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 14:48:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:48:52,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:48:52,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-15 14:48:52,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3879#true} is VALID [2022-04-15 14:48:52,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#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; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,638 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#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; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-15 14:48:52,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 5);havoc #t~post6; {3879#true} is VALID [2022-04-15 14:48:52,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,641 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:48:52,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,641 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,641 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:48:52,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,642 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,642 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:48:52,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,643 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,643 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:48:52,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:48:52,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:48:52,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:48:52,645 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:48:52,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(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; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-15 14:48:52,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-15 14:48:52,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-15 14:48:52,647 INFO L272 TraceCheckUtils]: 55: Hoare triple {4041#(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)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:48:52,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:48:52,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-15 14:48:52,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-15 14:48:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-15 14:48:52,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:13,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-15 14:49:13,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-15 14:49:13,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:13,558 INFO L272 TraceCheckUtils]: 55: Hoare triple {4071#(= 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)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:49:13,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:49:13,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:49:13,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(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; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:49:13,560 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,561 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:49:13,561 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,562 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:49:13,562 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,563 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:49:13,563 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,563 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-15 14:49:13,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 5);havoc #t~post6; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,565 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#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; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#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; {3879#true} is VALID [2022-04-15 14:49:13,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-15 14:49:13,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-15 14:49:13,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 14:49:13,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3879#true} is VALID [2022-04-15 14:49:13,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-15 14:49:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-15 14:49:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387007457] [2022-04-15 14:49:13,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440527069] [2022-04-15 14:49:13,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440527069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:13,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 14:49:13,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:13,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472205585] [2022-04-15 14:49:13,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472205585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:13,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:49:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024007157] [2022-04-15 14:49:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 59 [2022-04-15 14:49:13,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:13,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 14:49:13,604 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 14:49:13,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:49:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:49:13,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:49:13,605 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 14:49:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:13,961 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-15 14:49:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:49:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 59 [2022-04-15 14:49:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 14:49:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 14:49:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 14:49:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 14:49:13,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-15 14:49:14,020 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 14:49:14,021 INFO L225 Difference]: With dead ends: 96 [2022-04-15 14:49:14,021 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 14:49:14,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 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 14:49:14,022 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 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 14:49:14,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:49:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 14:49:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-15 14:49:14,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:14,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 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 14:49:14,099 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 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 14:49:14,099 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 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 14:49:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:14,102 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-15 14:49:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-15 14:49:14,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:14,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:14,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 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 94 states. [2022-04-15 14:49:14,103 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 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 94 states. [2022-04-15 14:49:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:14,105 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-15 14:49:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-15 14:49:14,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:14,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:14,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:14,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 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 14:49:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-15 14:49:14,108 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-15 14:49:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:14,109 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-15 14:49:14,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 14:49:14,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-15 14:49:14,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-15 14:49:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 14:49:14,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:14,240 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, 1, 1] [2022-04-15 14:49:14,257 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 14:49:14,441 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 14:49:14,441 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-15 14:49:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:14,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363851392] [2022-04-15 14:49:14,442 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-15 14:49:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:14,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2654087] [2022-04-15 14:49:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:14,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:14,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298706549] [2022-04-15 14:49:14,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:49:14,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:14,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:14,457 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 14:49:14,457 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 14:49:14,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:49:14,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:14,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:49:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:14,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:14,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-15 14:49:14,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #78#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,750 INFO L272 TraceCheckUtils]: 11: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,751 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #80#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,752 INFO L272 TraceCheckUtils]: 17: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,753 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #82#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,754 INFO L272 TraceCheckUtils]: 22: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,755 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #84#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:14,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {4797#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:14,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {4876#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:14,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {4876#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4876#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:14,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {4876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,758 INFO L272 TraceCheckUtils]: 32: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,759 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #86#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,759 INFO L272 TraceCheckUtils]: 37: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,761 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #88#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,761 INFO L272 TraceCheckUtils]: 42: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,763 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #90#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,763 INFO L272 TraceCheckUtils]: 47: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,765 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #92#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:14,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4959#(<= |main_#t~post6| 2)} is VALID [2022-04-15 14:49:14,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {4959#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {4790#false} is VALID [2022-04-15 14:49:14,766 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-15 14:49:14,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-15 14:49:14,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-15 14:49:14,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-15 14:49:14,766 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 14:49:14,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:15,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-15 14:49:15,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-15 14:49:15,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-15 14:49:15,014 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-15 14:49:15,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {4790#false} is VALID [2022-04-15 14:49:15,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {4991#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(< |main_#t~post6| 5)} is VALID [2022-04-15 14:49:15,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {4991#(< ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,016 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #92#return; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,016 INFO L272 TraceCheckUtils]: 47: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,017 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #90#return; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,018 INFO L272 TraceCheckUtils]: 42: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,018 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #88#return; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,018 INFO L272 TraceCheckUtils]: 37: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,019 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #86#return; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,019 INFO L272 TraceCheckUtils]: 32: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {4991#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {5064#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4991#(< ~counter~0 5)} is VALID [2022-04-15 14:49:15,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {5064#(< ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5064#(< ~counter~0 4)} is VALID [2022-04-15 14:49:15,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {5064#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {5064#(< ~counter~0 4)} is VALID [2022-04-15 14:49:15,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5064#(< ~counter~0 4)} is VALID [2022-04-15 14:49:15,021 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #84#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,022 INFO L272 TraceCheckUtils]: 22: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,022 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #82#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,022 INFO L272 TraceCheckUtils]: 17: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #80#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,023 INFO L272 TraceCheckUtils]: 11: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #78#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 14:49:15,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 14:49:15,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 14:49:15,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-15 14:49:15,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {4886#(<= ~counter~0 2)} call #t~ret8 := main(); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4886#(<= ~counter~0 2)} {4789#true} #98#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:15,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-15 14:49:15,026 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 14:49:15,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:15,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2654087] [2022-04-15 14:49:15,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:15,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298706549] [2022-04-15 14:49:15,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298706549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:15,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:15,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 14:49:15,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:15,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363851392] [2022-04-15 14:49:15,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363851392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:15,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:15,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:49:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438227771] [2022-04-15 14:49:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-15 14:49:15,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:15,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:15,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:15,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:49:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:15,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:49:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:49:15,056 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:15,250 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-15 14:49:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:49:15,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-15 14:49:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-15 14:49:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-15 14:49:15,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-15 14:49:15,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:15,316 INFO L225 Difference]: With dead ends: 111 [2022-04-15 14:49:15,316 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 14:49:15,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:49:15,317 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:49:15,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:49:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 14:49:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 14:49:15,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:15,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:49:15,431 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:49:15,431 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:49:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:15,434 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-15 14:49:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-15 14:49:15,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:15,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:15,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-15 14:49:15,434 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-15 14:49:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:15,437 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-15 14:49:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-15 14:49:15,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:15,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:15,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:15,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:49:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-15 14:49:15,440 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-15 14:49:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:15,440 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-15 14:49:15,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:15,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-15 14:49:15,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-15 14:49:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 14:49:15,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:15,579 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, 1, 1, 1, 1, 1] [2022-04-15 14:49:15,598 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 14:49:15,779 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 14:49:15,779 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:15,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-15 14:49:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:15,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1162603049] [2022-04-15 14:49:15,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-15 14:49:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:15,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641917994] [2022-04-15 14:49:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:15,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120978282] [2022-04-15 14:49:15,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:49:15,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:15,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:15,799 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 14:49:15,824 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 14:49:15,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:49:15,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:15,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:49:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:16,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-15 14:49:16,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5793#true} is VALID [2022-04-15 14:49:16,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #98#return; {5793#true} is VALID [2022-04-15 14:49:16,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret8 := main(); {5793#true} is VALID [2022-04-15 14:49:16,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#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; {5793#true} is VALID [2022-04-15 14:49:16,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {5793#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {5793#true} ~cond := #in~cond; {5819#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:49:16,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {5819#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:49:16,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:49:16,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} {5793#true} #78#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-15 14:49:16,047 INFO L272 TraceCheckUtils]: 11: Hoare triple {5830#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,048 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5793#true} {5830#(<= 1 main_~x~0)} #80#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-15 14:49:16,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {5830#(<= 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; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,048 INFO L272 TraceCheckUtils]: 17: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,049 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #82#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,049 INFO L272 TraceCheckUtils]: 22: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,050 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #84#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {5849#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {5889#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {5889#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,051 INFO L272 TraceCheckUtils]: 32: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,052 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #86#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,052 INFO L272 TraceCheckUtils]: 37: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,053 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #88#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,053 INFO L272 TraceCheckUtils]: 42: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,054 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #90#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,054 INFO L272 TraceCheckUtils]: 47: Hoare triple {5889#(<= 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)); {5793#true} is VALID [2022-04-15 14:49:16,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,054 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #92#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {5889#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {5889#(<= 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; {5962#(<= 1 main_~b~0)} is VALID [2022-04-15 14:49:16,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {5962#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-15 14:49:16,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {5962#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-15 14:49:16,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {5962#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5794#false} is VALID [2022-04-15 14:49:16,056 INFO L272 TraceCheckUtils]: 57: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5794#false} is VALID [2022-04-15 14:49:16,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-15 14:49:16,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-15 14:49:16,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-15 14:49:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 14:49:16,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:16,302 INFO L290 TraceCheckUtils]: 60: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-15 14:49:16,302 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-15 14:49:16,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-15 14:49:16,302 INFO L272 TraceCheckUtils]: 57: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5794#false} is VALID [2022-04-15 14:49:16,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {5962#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5794#false} is VALID [2022-04-15 14:49:16,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {5962#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-15 14:49:16,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {5962#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-15 14:49:16,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {5889#(<= 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; {5962#(<= 1 main_~b~0)} is VALID [2022-04-15 14:49:16,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {5889#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,304 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #92#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,305 INFO L272 TraceCheckUtils]: 47: Hoare triple {5889#(<= 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)); {5793#true} is VALID [2022-04-15 14:49:16,305 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #90#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,305 INFO L272 TraceCheckUtils]: 42: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,306 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #88#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,306 INFO L272 TraceCheckUtils]: 37: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,307 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #86#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,307 INFO L272 TraceCheckUtils]: 32: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {5889#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {5889#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5889#(<= 1 main_~c~0)} is VALID [2022-04-15 14:49:16,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {5849#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,309 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #84#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,309 INFO L272 TraceCheckUtils]: 22: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,310 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #82#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,310 INFO L272 TraceCheckUtils]: 17: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {5830#(<= 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; {5849#(<= 1 main_~a~0)} is VALID [2022-04-15 14:49:16,311 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5793#true} {5830#(<= 1 main_~x~0)} #80#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-15 14:49:16,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-15 14:49:16,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-15 14:49:16,311 INFO L272 TraceCheckUtils]: 11: Hoare triple {5830#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} {5793#true} #78#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-15 14:49:16,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:49:16,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {6143#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:49:16,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {5793#true} ~cond := #in~cond; {6143#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 14:49:16,313 INFO L272 TraceCheckUtils]: 6: Hoare triple {5793#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-15 14:49:16,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#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; {5793#true} is VALID [2022-04-15 14:49:16,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret8 := main(); {5793#true} is VALID [2022-04-15 14:49:16,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #98#return; {5793#true} is VALID [2022-04-15 14:49:16,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-15 14:49:16,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5793#true} is VALID [2022-04-15 14:49:16,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-15 14:49:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 14:49:16,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:16,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641917994] [2022-04-15 14:49:16,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:16,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120978282] [2022-04-15 14:49:16,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120978282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:16,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:16,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 14:49:16,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:16,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1162603049] [2022-04-15 14:49:16,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1162603049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:16,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:16,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:49:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956635259] [2022-04-15 14:49:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:16,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-15 14:49:16,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:16,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 14:49:16,348 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 14:49:16,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:49:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:49:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:49:16,349 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 14:49:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:17,178 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-15 14:49:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 14:49:17,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-15 14:49:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 14:49:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-15 14:49:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 14:49:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-15 14:49:17,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-15 14:49:17,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:17,302 INFO L225 Difference]: With dead ends: 182 [2022-04-15 14:49:17,302 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 14:49:17,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-15 14:49:17,303 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 14:49:17,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 317 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 14:49:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 14:49:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-15 14:49:17,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:17,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:17,504 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:17,504 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:17,508 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-15 14:49:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-15 14:49:17,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:17,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:17,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-15 14:49:17,510 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-15 14:49:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:17,515 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-15 14:49:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-15 14:49:17,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:17,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:17,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:17,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-15 14:49:17,519 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-15 14:49:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:17,520 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-15 14:49:17,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 14:49:17,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-15 14:49:17,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-15 14:49:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 14:49:17,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:17,723 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, 1, 1, 1, 1, 1, 1] [2022-04-15 14:49:17,738 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 14:49:17,938 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 14:49:17,941 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-15 14:49:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:17,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1395794975] [2022-04-15 14:49:17,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-15 14:49:17,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:17,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327663644] [2022-04-15 14:49:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:17,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245453701] [2022-04-15 14:49:17,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:49:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:17,964 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 14:49:17,965 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 14:49:18,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:49:18,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:18,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:49:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:18,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:18,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {7185#true} call ULTIMATE.init(); {7185#true} is VALID [2022-04-15 14:49:18,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {7185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7193#(<= ~counter~0 0)} {7185#true} #98#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {7193#(<= ~counter~0 0)} call #t~ret8 := main(); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {7193#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #78#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #80#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {7193#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,239 INFO L272 TraceCheckUtils]: 17: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,243 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #82#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,244 INFO L272 TraceCheckUtils]: 22: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,245 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #84#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:18,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {7193#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7272#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:18,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {7272#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {7272#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:18,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {7272#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7272#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:18,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {7272#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {7282#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,247 INFO L272 TraceCheckUtils]: 32: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,249 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #86#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,249 INFO L272 TraceCheckUtils]: 37: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,251 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #88#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,251 INFO L272 TraceCheckUtils]: 42: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,253 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #90#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,253 INFO L272 TraceCheckUtils]: 47: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,255 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #92#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {7282#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {7282#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7352#(<= |main_#t~post7| 2)} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {7352#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {7186#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; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {7186#false} assume !(#t~post6 < 5);havoc #t~post6; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L272 TraceCheckUtils]: 58: Hoare triple {7186#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {7186#false} ~cond := #in~cond; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {7186#false} assume 0 == ~cond; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-04-15 14:49:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-15 14:49:18,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:18,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-04-15 14:49:18,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {7186#false} assume 0 == ~cond; {7186#false} is VALID [2022-04-15 14:49:18,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {7186#false} ~cond := #in~cond; {7186#false} is VALID [2022-04-15 14:49:18,495 INFO L272 TraceCheckUtils]: 58: Hoare triple {7186#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7186#false} is VALID [2022-04-15 14:49:18,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {7186#false} assume !(#t~post6 < 5);havoc #t~post6; {7186#false} is VALID [2022-04-15 14:49:18,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7186#false} is VALID [2022-04-15 14:49:18,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {7186#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; {7186#false} is VALID [2022-04-15 14:49:18,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {7186#false} is VALID [2022-04-15 14:49:18,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {7402#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7398#(< |main_#t~post7| 5)} is VALID [2022-04-15 14:49:18,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {7402#(< ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,497 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #92#return; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,497 INFO L272 TraceCheckUtils]: 47: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,498 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #90#return; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,498 INFO L272 TraceCheckUtils]: 42: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,499 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #88#return; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,499 INFO L272 TraceCheckUtils]: 37: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,500 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #86#return; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,500 INFO L272 TraceCheckUtils]: 32: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {7402#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {7472#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7402#(< ~counter~0 5)} is VALID [2022-04-15 14:49:18,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {7472#(< ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7472#(< ~counter~0 4)} is VALID [2022-04-15 14:49:18,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {7472#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {7472#(< ~counter~0 4)} is VALID [2022-04-15 14:49:18,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {7282#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7472#(< ~counter~0 4)} is VALID [2022-04-15 14:49:18,502 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #84#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,502 INFO L272 TraceCheckUtils]: 22: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,503 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #82#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,503 INFO L272 TraceCheckUtils]: 17: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {7282#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,504 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #80#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #78#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-15 14:49:18,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-15 14:49:18,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-15 14:49:18,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7185#true} is VALID [2022-04-15 14:49:18,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {7282#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {7282#(<= ~counter~0 2)} call #t~ret8 := main(); {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7282#(<= ~counter~0 2)} {7185#true} #98#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {7185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7282#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:18,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {7185#true} call ULTIMATE.init(); {7185#true} is VALID [2022-04-15 14:49:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-15 14:49:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:18,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327663644] [2022-04-15 14:49:18,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:18,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245453701] [2022-04-15 14:49:18,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245453701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:18,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:18,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 14:49:18,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:18,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1395794975] [2022-04-15 14:49:18,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1395794975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:18,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:18,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:49:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209462033] [2022-04-15 14:49:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-15 14:49:18,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:18,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:18,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:18,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:49:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:49:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:49:18,539 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:18,874 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-15 14:49:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:49:18,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-15 14:49:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-15 14:49:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-15 14:49:18,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-15 14:49:18,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:18,944 INFO L225 Difference]: With dead ends: 183 [2022-04-15 14:49:18,944 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 14:49:18,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:49:18,945 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:49:18,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:49:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 14:49:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-15 14:49:19,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:19,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:19,158 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:19,158 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:19,161 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-15 14:49:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-15 14:49:19,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:19,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:19,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-15 14:49:19,162 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-15 14:49:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:19,165 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-15 14:49:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-15 14:49:19,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:19,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:19,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:19,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 14:49:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-15 14:49:19,169 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-15 14:49:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:19,169 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-15 14:49:19,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:19,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-15 14:49:19,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-15 14:49:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 14:49:19,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:19,364 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:49:19,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 14:49:19,567 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 14:49:19,567 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-15 14:49:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341555834] [2022-04-15 14:49:19,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-15 14:49:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921734637] [2022-04-15 14:49:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:19,578 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:19,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232657965] [2022-04-15 14:49:19,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:49:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:19,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:19,579 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 14:49:19,580 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 14:49:19,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:49:19,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:19,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 14:49:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:19,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:19,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-15 14:49:19,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8525#(<= ~counter~0 0)} {8517#true} #98#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {8525#(<= ~counter~0 0)} call #t~ret8 := main(); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {8525#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #78#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #80#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {8525#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,896 INFO L272 TraceCheckUtils]: 17: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,897 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #82#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,898 INFO L272 TraceCheckUtils]: 22: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,899 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #84#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-15 14:49:19,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {8525#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:19,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {8604#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:19,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {8604#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:19,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {8604#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {8614#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,901 INFO L272 TraceCheckUtils]: 32: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,902 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #86#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,903 INFO L272 TraceCheckUtils]: 37: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,904 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #88#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,904 INFO L272 TraceCheckUtils]: 42: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,906 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #90#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,906 INFO L272 TraceCheckUtils]: 47: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,908 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #92#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {8614#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {8614#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:19,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {8614#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:19,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {8687#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:19,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {8687#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:19,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {8687#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8697#(<= |main_#t~post7| 3)} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {8697#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {8518#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; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {8518#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {8518#false} assume !(#t~post6 < 5);havoc #t~post6; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L272 TraceCheckUtils]: 62: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 64: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L290 TraceCheckUtils]: 65: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-15 14:49:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-15 14:49:19,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:20,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-15 14:49:20,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-15 14:49:20,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-15 14:49:20,151 INFO L272 TraceCheckUtils]: 62: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8518#false} is VALID [2022-04-15 14:49:20,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {8518#false} assume !(#t~post6 < 5);havoc #t~post6; {8518#false} is VALID [2022-04-15 14:49:20,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {8518#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8518#false} is VALID [2022-04-15 14:49:20,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {8518#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; {8518#false} is VALID [2022-04-15 14:49:20,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {8743#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {8518#false} is VALID [2022-04-15 14:49:20,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {8747#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8743#(< |main_#t~post7| 5)} is VALID [2022-04-15 14:49:20,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {8747#(< ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8747#(< ~counter~0 5)} is VALID [2022-04-15 14:49:20,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {8747#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {8747#(< ~counter~0 5)} is VALID [2022-04-15 14:49:20,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {8687#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8747#(< ~counter~0 5)} is VALID [2022-04-15 14:49:20,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {8687#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {8687#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,155 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #92#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,155 INFO L272 TraceCheckUtils]: 47: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,156 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #90#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,156 INFO L272 TraceCheckUtils]: 42: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,156 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #88#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,157 INFO L272 TraceCheckUtils]: 37: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,157 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #86#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,158 INFO L272 TraceCheckUtils]: 32: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {8687#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {8614#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8687#(<= ~counter~0 3)} is VALID [2022-04-15 14:49:20,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {8614#(<= ~counter~0 2)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:20,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {8614#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:20,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8614#(<= ~counter~0 2)} is VALID [2022-04-15 14:49:20,160 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #84#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,160 INFO L272 TraceCheckUtils]: 22: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,161 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #82#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,161 INFO L272 TraceCheckUtils]: 17: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {8604#(<= ~counter~0 1)} ~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; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,162 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #80#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,162 INFO L272 TraceCheckUtils]: 11: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #78#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-15 14:49:20,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-15 14:49:20,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-15 14:49:20,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8517#true} is VALID [2022-04-15 14:49:20,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {8604#(<= ~counter~0 1)} 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; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {8604#(<= ~counter~0 1)} call #t~ret8 := main(); {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8604#(<= ~counter~0 1)} {8517#true} #98#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {8604#(<= ~counter~0 1)} assume true; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8604#(<= ~counter~0 1)} is VALID [2022-04-15 14:49:20,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-15 14:49:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-15 14:49:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921734637] [2022-04-15 14:49:20,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232657965] [2022-04-15 14:49:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232657965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:20,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 14:49:20,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:20,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341555834] [2022-04-15 14:49:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341555834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:20,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:49:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691826192] [2022-04-15 14:49:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-15 14:49:20,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:20,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:20,205 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 14:49:20,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:49:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:20,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:49:20,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:49:20,206 INFO L87 Difference]: Start difference. First operand 146 states and 198 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:20,673 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-15 14:49:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:49:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-15 14:49:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 14:49:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 14:49:20,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-15 14:49:20,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:20,767 INFO L225 Difference]: With dead ends: 253 [2022-04-15 14:49:20,767 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 14:49:20,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:49:20,770 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:49:20,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:49:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 14:49:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-15 14:49:21,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:21,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-15 14:49:21,007 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-15 14:49:21,007 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-15 14:49:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:21,010 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-15 14:49:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-15 14:49:21,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:21,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:21,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-15 14:49:21,011 INFO L87 Difference]: Start difference. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-15 14:49:21,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:21,014 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-15 14:49:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-15 14:49:21,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:21,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:21,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:21,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-15 14:49:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-15 14:49:21,018 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-15 14:49:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:21,019 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-15 14:49:21,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 14:49:21,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-15 14:49:21,268 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 14:49:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-15 14:49:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 14:49:21,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:21,269 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:49:21,285 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 14:49:21,484 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 14:49:21,484 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-15 14:49:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:21,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447116916] [2022-04-15 14:49:21,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-15 14:49:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:21,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60175891] [2022-04-15 14:49:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:21,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:21,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64910961] [2022-04-15 14:49:21,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:49:21,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:21,495 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 14:49:21,495 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 14:49:21,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:49:21,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 14:49:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:21,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:21,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {10119#true} call ULTIMATE.init(); {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10119#true} {10119#true} #98#return; {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {10119#true} call #t~ret8 := main(); {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {10119#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; {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {10119#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10119#true} {10119#true} #78#return; {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {10119#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10119#true} {10119#true} #80#return; {10119#true} is VALID [2022-04-15 14:49:21,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {10119#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; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:49:21,833 INFO L272 TraceCheckUtils]: 17: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:21,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,843 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10119#true} {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:49:21,843 INFO L272 TraceCheckUtils]: 22: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:21,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,844 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10119#true} {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:49:21,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:49:21,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:49:21,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,846 INFO L272 TraceCheckUtils]: 32: Hoare triple {10212#(and (= 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)); {10119#true} is VALID [2022-04-15 14:49:21,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,847 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10119#true} {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,847 INFO L272 TraceCheckUtils]: 37: Hoare triple {10212#(and (= 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)); {10119#true} is VALID [2022-04-15 14:49:21,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,848 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10119#true} {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,848 INFO L272 TraceCheckUtils]: 42: Hoare triple {10212#(and (= 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)); {10119#true} is VALID [2022-04-15 14:49:21,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {10119#true} ~cond := #in~cond; {10255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:21,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {10255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:49:21,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:49:21,850 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,850 INFO L272 TraceCheckUtils]: 47: Hoare triple {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:21,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,851 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10119#true} {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 14:49:21,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post6 < 5);havoc #t~post6; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {10288#(and (= main_~p~0 0) (= 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; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,854 INFO L272 TraceCheckUtils]: 59: Hoare triple {10288#(and (= main_~p~0 0) (= 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)); {10119#true} is VALID [2022-04-15 14:49:21,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:21,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:21,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:21,855 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10119#true} {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #86#return; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-15 14:49:21,856 INFO L272 TraceCheckUtils]: 64: Hoare triple {10288#(and (= main_~p~0 0) (= 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)); {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:49:21,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:21,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {10326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10120#false} is VALID [2022-04-15 14:49:21,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-04-15 14:49:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 14:49:21,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:40,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-04-15 14:49:40,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {10326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10120#false} is VALID [2022-04-15 14:49:40,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:40,827 INFO L272 TraceCheckUtils]: 64: Hoare triple {10342#(= 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)); {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:49:40,827 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10119#true} {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,827 INFO L272 TraceCheckUtils]: 59: Hoare triple {10342#(= 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)); {10119#true} is VALID [2022-04-15 14:49:40,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {10342#(= 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; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {10376#(= 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; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:49:40,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:40,830 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10119#true} {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:40,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,831 INFO L272 TraceCheckUtils]: 47: Hoare triple {10376#(= 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)); {10119#true} is VALID [2022-04-15 14:49:40,831 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} {10119#true} #90#return; {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:40,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:49:40,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {10407#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:49:40,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {10119#true} ~cond := #in~cond; {10407#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:49:40,832 INFO L272 TraceCheckUtils]: 42: Hoare triple {10119#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,832 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10119#true} {10119#true} #88#return; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L272 TraceCheckUtils]: 37: Hoare triple {10119#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10119#true} {10119#true} #86#return; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L272 TraceCheckUtils]: 32: Hoare triple {10119#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {10119#true} assume !!(#t~post7 < 5);havoc #t~post7; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {10119#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {10119#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {10119#true} assume !!(#t~post6 < 5);havoc #t~post6; {10119#true} is VALID [2022-04-15 14:49:40,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {10119#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10119#true} {10119#true} #84#return; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L272 TraceCheckUtils]: 22: Hoare triple {10119#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10119#true} {10119#true} #82#return; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L272 TraceCheckUtils]: 17: Hoare triple {10119#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {10119#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; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10119#true} {10119#true} #80#return; {10119#true} is VALID [2022-04-15 14:49:40,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {10119#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10119#true} {10119#true} #78#return; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L272 TraceCheckUtils]: 6: Hoare triple {10119#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {10119#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; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {10119#true} call #t~ret8 := main(); {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10119#true} {10119#true} #98#return; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-15 14:49:40,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10119#true} is VALID [2022-04-15 14:49:40,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {10119#true} call ULTIMATE.init(); {10119#true} is VALID [2022-04-15 14:49:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 14:49:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:40,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60175891] [2022-04-15 14:49:40,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:40,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64910961] [2022-04-15 14:49:40,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64910961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:40,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:40,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-15 14:49:40,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:40,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447116916] [2022-04-15 14:49:40,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447116916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:40,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:40,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 14:49:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246248517] [2022-04-15 14:49:40,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:40,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-15 14:49:40,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:40,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:49:40,876 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 14:49:40,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 14:49:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 14:49:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:49:40,877 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:49:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:41,746 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-15 14:49:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 14:49:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-15 14:49:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:49:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-15 14:49:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:49:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-15 14:49:41,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-15 14:49:41,831 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 14:49:41,835 INFO L225 Difference]: With dead ends: 195 [2022-04-15 14:49:41,835 INFO L226 Difference]: Without dead ends: 193 [2022-04-15 14:49:41,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-15 14:49:41,835 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 14:49:41,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 235 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 14:49:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-15 14:49:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-15 14:49:42,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:42,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:42,093 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:42,093 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:42,098 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-15 14:49:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-15 14:49:42,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:42,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:42,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-15 14:49:42,099 INFO L87 Difference]: Start difference. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-15 14:49:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:42,103 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-15 14:49:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-15 14:49:42,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:42,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:42,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:42,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-15 14:49:42,112 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-15 14:49:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:42,112 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-15 14:49:42,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 14:49:42,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-15 14:49:42,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-15 14:49:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 14:49:42,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:42,414 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:49:42,433 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 14:49:42,627 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 14:49:42,627 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:42,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-15 14:49:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187370463] [2022-04-15 14:49:42,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-15 14:49:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309763053] [2022-04-15 14:49:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:42,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:42,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023825590] [2022-04-15 14:49:42,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 14:49:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:42,639 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 14:49:42,642 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 14:49:42,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 14:49:42,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:42,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 14:49:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:42,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:43,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {11703#true} call ULTIMATE.init(); {11703#true} is VALID [2022-04-15 14:49:43,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {11703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11703#true} is VALID [2022-04-15 14:49:43,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11703#true} {11703#true} #98#return; {11703#true} is VALID [2022-04-15 14:49:43,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {11703#true} call #t~ret8 := main(); {11703#true} is VALID [2022-04-15 14:49:43,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {11703#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; {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {11703#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11703#true} {11703#true} #78#return; {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L272 TraceCheckUtils]: 11: Hoare triple {11703#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11703#true} {11703#true} #80#return; {11703#true} is VALID [2022-04-15 14:49:43,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {11703#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; {11756#(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 14:49:43,168 INFO L272 TraceCheckUtils]: 17: Hoare triple {11756#(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)); {11703#true} is VALID [2022-04-15 14:49:43,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,169 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11703#true} {11756#(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; {11756#(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 14:49:43,169 INFO L272 TraceCheckUtils]: 22: Hoare triple {11756#(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)); {11703#true} is VALID [2022-04-15 14:49:43,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,170 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11703#true} {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {11756#(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 14:49:43,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11756#(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 14:49:43,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {11756#(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 14:49:43,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {11756#(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; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,172 INFO L272 TraceCheckUtils]: 32: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,173 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,173 INFO L272 TraceCheckUtils]: 37: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,174 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,174 INFO L272 TraceCheckUtils]: 42: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,175 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,175 INFO L272 TraceCheckUtils]: 47: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,176 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:43,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~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; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,178 INFO L272 TraceCheckUtils]: 59: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,179 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11703#true} {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,179 INFO L272 TraceCheckUtils]: 64: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:43,179 INFO L290 TraceCheckUtils]: 65: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,179 INFO L290 TraceCheckUtils]: 66: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,180 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11703#true} {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 14:49:43,181 INFO L272 TraceCheckUtils]: 69: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:49:43,181 INFO L290 TraceCheckUtils]: 70: Hoare triple {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:43,181 INFO L290 TraceCheckUtils]: 71: Hoare triple {11922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11704#false} is VALID [2022-04-15 14:49:43,181 INFO L290 TraceCheckUtils]: 72: Hoare triple {11704#false} assume !false; {11704#false} is VALID [2022-04-15 14:49:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 14:49:43,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:49:43,446 INFO L290 TraceCheckUtils]: 72: Hoare triple {11704#false} assume !false; {11704#false} is VALID [2022-04-15 14:49:43,447 INFO L290 TraceCheckUtils]: 71: Hoare triple {11922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11704#false} is VALID [2022-04-15 14:49:43,447 INFO L290 TraceCheckUtils]: 70: Hoare triple {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:43,448 INFO L272 TraceCheckUtils]: 69: Hoare triple {11938#(= 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)); {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:49:43,448 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11703#true} {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:43,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,449 INFO L272 TraceCheckUtils]: 64: Hoare triple {11938#(= 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)); {11703#true} is VALID [2022-04-15 14:49:43,449 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11703#true} {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:43,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:43,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:43,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:43,450 INFO L272 TraceCheckUtils]: 59: Hoare triple {11938#(= 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)); {11703#true} is VALID [2022-04-15 14:49:43,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:43,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:43,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {11938#(= 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; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:43,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:43,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:49:45,453 WARN L290 TraceCheckUtils]: 53: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~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; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-15 14:49:45,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,454 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #92#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,454 INFO L290 TraceCheckUtils]: 50: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,454 INFO L272 TraceCheckUtils]: 47: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~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)); {11703#true} is VALID [2022-04-15 14:49:45,456 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #90#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,456 INFO L272 TraceCheckUtils]: 42: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,457 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #88#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,457 INFO L272 TraceCheckUtils]: 37: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,458 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #86#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,458 INFO L272 TraceCheckUtils]: 32: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-15 14:49:45,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-15 14:49:45,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-15 14:49:45,460 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11703#true} {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #84#return; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-15 14:49:45,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,461 INFO L272 TraceCheckUtils]: 22: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,461 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11703#true} {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #82#return; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-15 14:49:45,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,462 INFO L272 TraceCheckUtils]: 17: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {11703#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; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-15 14:49:45,464 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11703#true} {11703#true} #80#return; {11703#true} is VALID [2022-04-15 14:49:45,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,464 INFO L272 TraceCheckUtils]: 11: Hoare triple {11703#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,464 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11703#true} {11703#true} #78#return; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {11703#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {11703#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; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {11703#true} call #t~ret8 := main(); {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11703#true} {11703#true} #98#return; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {11703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {11703#true} call ULTIMATE.init(); {11703#true} is VALID [2022-04-15 14:49:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 14:49:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:49:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309763053] [2022-04-15 14:49:45,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:49:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023825590] [2022-04-15 14:49:45,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023825590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:49:45,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:49:45,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-15 14:49:45,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:49:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187370463] [2022-04-15 14:49:45,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187370463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:49:45,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:49:45,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:49:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565854420] [2022-04-15 14:49:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:49:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-15 14:49:45,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:49:45,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-15 14:49:45,526 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 14:49:45,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:49:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:45,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:49:45,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:49:45,527 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-15 14:49:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:46,323 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-15 14:49:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:49:46,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-15 14:49:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:49:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-15 14:49:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-15 14:49:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-15 14:49:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-15 14:49:46,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-15 14:49:46,414 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 14:49:46,418 INFO L225 Difference]: With dead ends: 199 [2022-04-15 14:49:46,418 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 14:49:46,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:49:46,418 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 14:49:46,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 234 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 14:49:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 14:49:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-15 14:49:46,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:49:46,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:46,699 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:46,699 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:46,703 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-15 14:49:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-15 14:49:46,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:46,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:46,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-15 14:49:46,704 INFO L87 Difference]: Start difference. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-15 14:49:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:49:46,708 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-15 14:49:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-15 14:49:46,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:49:46,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:49:46,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:49:46,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:49:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:49:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-15 14:49:46,712 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-15 14:49:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:49:46,713 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-15 14:49:46,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-15 14:49:46,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-15 14:49:46,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:49:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-15 14:49:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 14:49:46,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:49:46,999 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:49:47,014 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 14:49:47,203 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 14:49:47,205 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:49:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:49:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-15 14:49:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:49:47,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384003476] [2022-04-15 14:49:47,206 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:49:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-15 14:49:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:49:47,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146477749] [2022-04-15 14:49:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:49:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:49:47,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:49:47,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387172243] [2022-04-15 14:49:47,215 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 14:49:47,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:49:47,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:49:47,216 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 14:49:47,217 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 14:49:47,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 14:49:47,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:49:47,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 14:49:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:49:47,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:49:49,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {13334#true} call ULTIMATE.init(); {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {13334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13334#true} {13334#true} #98#return; {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {13334#true} call #t~ret8 := main(); {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {13334#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; {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {13334#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {13334#true} ~cond := #in~cond; {13360#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:49:49,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {13360#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13364#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:49:49,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {13364#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13364#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:49:49,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13364#(not (= |assume_abort_if_not_#in~cond| 0))} {13334#true} #78#return; {13371#(<= 1 main_~x~0)} is VALID [2022-04-15 14:49:49,347 INFO L272 TraceCheckUtils]: 11: Hoare triple {13371#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13334#true} {13371#(<= 1 main_~x~0)} #80#return; {13371#(<= 1 main_~x~0)} is VALID [2022-04-15 14:49:49,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {13371#(<= 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; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,348 INFO L272 TraceCheckUtils]: 17: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,349 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13334#true} {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,349 INFO L272 TraceCheckUtils]: 22: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,350 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13334#true} {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,352 INFO L272 TraceCheckUtils]: 32: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,353 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13334#true} {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,353 INFO L272 TraceCheckUtils]: 37: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,354 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13334#true} {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,354 INFO L272 TraceCheckUtils]: 42: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,355 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13334#true} {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,355 INFO L272 TraceCheckUtils]: 47: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13334#true} is VALID [2022-04-15 14:49:49,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,356 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13334#true} {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {13430#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13500#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:49:49,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {13500#(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_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,359 INFO L272 TraceCheckUtils]: 59: Hoare triple {13504#(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) (= 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)); {13334#true} is VALID [2022-04-15 14:49:49,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,360 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13334#true} {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,360 INFO L272 TraceCheckUtils]: 64: Hoare triple {13504#(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) (= 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)); {13334#true} is VALID [2022-04-15 14:49:49,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-15 14:49:49,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-15 14:49:49,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-15 14:49:49,361 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13334#true} {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,361 INFO L272 TraceCheckUtils]: 69: Hoare triple {13504#(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) (= 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)); {13334#true} is VALID [2022-04-15 14:49:49,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {13334#true} ~cond := #in~cond; {13556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:49,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {13556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:49:49,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:49:49,362 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {13504#(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) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:49:49,363 INFO L272 TraceCheckUtils]: 74: Hoare triple {13504#(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) (= 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)); {13570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:49:49,364 INFO L290 TraceCheckUtils]: 75: Hoare triple {13570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:49:49,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {13574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13335#false} is VALID [2022-04-15 14:49:49,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {13335#false} assume !false; {13335#false} is VALID [2022-04-15 14:49:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-15 14:49:49,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:50:44,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:50:44,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146477749] [2022-04-15 14:50:44,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:50:44,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387172243] [2022-04-15 14:50:44,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387172243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:50:44,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:50:44,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 14:50:44,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:50:44,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384003476] [2022-04-15 14:50:44,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384003476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:50:44,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:50:44,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 14:50:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010329586] [2022-04-15 14:50:44,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:50:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-15 14:50:44,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:50:44,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 14:50:44,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:50:44,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 14:50:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:50:44,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 14:50:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-15 14:50:44,143 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 14:50:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:50:49,256 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-15 14:50:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 14:50:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-15 14:50:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:50:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 14:50:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-15 14:50:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 14:50:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-15 14:50:49,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-15 14:50:49,360 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 14:50:49,364 INFO L225 Difference]: With dead ends: 203 [2022-04-15 14:50:49,364 INFO L226 Difference]: Without dead ends: 201 [2022-04-15 14:50:49,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-15 14:50:49,364 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:50:49,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 205 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 14:50:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-15 14:50:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-15 14:50:49,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:50:49,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:50:49,632 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:50:49,633 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:50:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:50:49,636 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-15 14:50:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-15 14:50:49,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:50:49,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:50:49,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-15 14:50:49,644 INFO L87 Difference]: Start difference. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-15 14:50:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:50:49,648 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-15 14:50:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-15 14:50:49,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:50:49,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:50:49,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:50:49,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:50:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-15 14:50:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-15 14:50:49,652 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-15 14:50:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:50:49,652 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-15 14:50:49,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 14:50:49,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-15 14:50:49,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:50:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-15 14:50:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 14:50:49,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:50:49,984 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:50:50,007 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 14:50:50,199 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 14:50:50,199 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:50:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:50:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-15 14:50:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:50:50,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866429275] [2022-04-15 14:50:50,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:50:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-15 14:50:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:50:50,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074301913] [2022-04-15 14:50:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:50:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:50:50,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:50:50,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639726946] [2022-04-15 14:50:50,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 14:50:50,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:50:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:50:50,223 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 14:50:50,228 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 14:50:50,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 14:50:50,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:50:50,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 14:50:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:50:50,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:50:51,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {14811#true} call ULTIMATE.init(); {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {14811#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14811#true} {14811#true} #98#return; {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {14811#true} call #t~ret8 := main(); {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {14811#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; {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {14811#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14811#true} {14811#true} #78#return; {14811#true} is VALID [2022-04-15 14:50:51,474 INFO L272 TraceCheckUtils]: 11: Hoare triple {14811#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {14811#true} ~cond := #in~cond; {14852#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:50:51,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {14852#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14856#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:50:51,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {14856#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14856#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:50:51,475 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14856#(not (= |assume_abort_if_not_#in~cond| 0))} {14811#true} #80#return; {14863#(<= 1 main_~y~0)} is VALID [2022-04-15 14:50:51,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {14863#(<= 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; {14867#(<= 1 main_~b~0)} is VALID [2022-04-15 14:50:51,475 INFO L272 TraceCheckUtils]: 17: Hoare triple {14867#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,476 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14811#true} {14867#(<= 1 main_~b~0)} #82#return; {14867#(<= 1 main_~b~0)} is VALID [2022-04-15 14:50:51,476 INFO L272 TraceCheckUtils]: 22: Hoare triple {14867#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,477 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14811#true} {14867#(<= 1 main_~b~0)} #84#return; {14867#(<= 1 main_~b~0)} is VALID [2022-04-15 14:50:51,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {14867#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14867#(<= 1 main_~b~0)} is VALID [2022-04-15 14:50:51,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {14867#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {14867#(<= 1 main_~b~0)} is VALID [2022-04-15 14:50:51,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {14867#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,478 INFO L272 TraceCheckUtils]: 32: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-15 14:50:51,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,479 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #86#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,479 INFO L272 TraceCheckUtils]: 37: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-15 14:50:51,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,479 INFO L290 TraceCheckUtils]: 39: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,480 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #88#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,480 INFO L272 TraceCheckUtils]: 42: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-15 14:50:51,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,484 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #90#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,484 INFO L272 TraceCheckUtils]: 47: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-15 14:50:51,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,485 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #92#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {14907#(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; {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,486 INFO L272 TraceCheckUtils]: 55: Hoare triple {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {14811#true} ~cond := #in~cond; {14990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:50:51,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {14990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:50:51,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:50:51,488 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #86#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,488 INFO L272 TraceCheckUtils]: 60: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,489 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14811#true} {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #88#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,489 INFO L272 TraceCheckUtils]: 65: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:51,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,489 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14811#true} {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #90#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,489 INFO L272 TraceCheckUtils]: 70: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~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)); {14811#true} is VALID [2022-04-15 14:50:51,490 INFO L290 TraceCheckUtils]: 71: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:51,490 INFO L290 TraceCheckUtils]: 72: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:51,490 INFO L290 TraceCheckUtils]: 73: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:51,490 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14811#true} {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #92#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,492 INFO L290 TraceCheckUtils]: 76: Hoare triple {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,492 INFO L290 TraceCheckUtils]: 77: Hoare triple {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-15 14:50:51,494 INFO L272 TraceCheckUtils]: 78: Hoare triple {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15060#(exists ((v_main_~k~0_BEFORE_CALL_31 Int) (v_main_~b~0_BEFORE_CALL_59 Int)) (and (<= 2 v_main_~k~0_BEFORE_CALL_31) (<= (* v_main_~k~0_BEFORE_CALL_31 v_main_~b~0_BEFORE_CALL_59) (* 2 v_main_~b~0_BEFORE_CALL_59)) (<= 1 v_main_~b~0_BEFORE_CALL_59) (<= 1 |__VERIFIER_assert_#in~cond|)))} is VALID [2022-04-15 14:50:51,494 INFO L290 TraceCheckUtils]: 79: Hoare triple {15060#(exists ((v_main_~k~0_BEFORE_CALL_31 Int) (v_main_~b~0_BEFORE_CALL_59 Int)) (and (<= 2 v_main_~k~0_BEFORE_CALL_31) (<= (* v_main_~k~0_BEFORE_CALL_31 v_main_~b~0_BEFORE_CALL_59) (* 2 v_main_~b~0_BEFORE_CALL_59)) (<= 1 v_main_~b~0_BEFORE_CALL_59) (<= 1 |__VERIFIER_assert_#in~cond|)))} ~cond := #in~cond; {15064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:50:51,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14812#false} is VALID [2022-04-15 14:50:51,495 INFO L290 TraceCheckUtils]: 81: Hoare triple {14812#false} assume !false; {14812#false} is VALID [2022-04-15 14:50:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-15 14:50:51,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:50:58,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {14812#false} assume !false; {14812#false} is VALID [2022-04-15 14:50:58,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14812#false} is VALID [2022-04-15 14:50:58,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {15077#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:50:58,197 INFO L272 TraceCheckUtils]: 78: Hoare triple {15081#(= 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)); {15077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:50:58,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {15081#(= 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; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,200 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14811#true} {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,201 INFO L272 TraceCheckUtils]: 70: Hoare triple {15081#(= 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)); {14811#true} is VALID [2022-04-15 14:50:58,201 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14811#true} {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,202 INFO L272 TraceCheckUtils]: 65: Hoare triple {15081#(= 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)); {14811#true} is VALID [2022-04-15 14:50:58,202 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14811#true} {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,202 INFO L272 TraceCheckUtils]: 60: Hoare triple {15081#(= 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)); {14811#true} is VALID [2022-04-15 14:50:58,203 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} {14811#true} #86#return; {15081#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:50:58,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {15148#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {14811#true} ~cond := #in~cond; {15148#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:50:58,204 INFO L272 TraceCheckUtils]: 55: Hoare triple {14811#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {14811#true} assume !!(#t~post7 < 5);havoc #t~post7; {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {14811#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {14811#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14811#true} {14811#true} #92#return; {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,204 INFO L272 TraceCheckUtils]: 47: Hoare triple {14811#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)); {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14811#true} {14811#true} #90#return; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L272 TraceCheckUtils]: 42: Hoare triple {14811#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14811#true} {14811#true} #88#return; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L272 TraceCheckUtils]: 37: Hoare triple {14811#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14811#true} {14811#true} #86#return; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L272 TraceCheckUtils]: 32: Hoare triple {14811#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {14811#true} assume !!(#t~post7 < 5);havoc #t~post7; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {14811#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {14811#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {14811#true} assume !!(#t~post6 < 5);havoc #t~post6; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {14811#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14811#true} {14811#true} #84#return; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L272 TraceCheckUtils]: 22: Hoare triple {14811#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14811#true} {14811#true} #82#return; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L272 TraceCheckUtils]: 17: Hoare triple {14811#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {14811#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; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14811#true} {14811#true} #80#return; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L272 TraceCheckUtils]: 11: Hoare triple {14811#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14811#true} {14811#true} #78#return; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-15 14:50:58,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {14811#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {14811#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; {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {14811#true} call #t~ret8 := main(); {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14811#true} {14811#true} #98#return; {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {14811#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {14811#true} call ULTIMATE.init(); {14811#true} is VALID [2022-04-15 14:50:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-15 14:50:58,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:50:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074301913] [2022-04-15 14:50:58,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:50:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639726946] [2022-04-15 14:50:58,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639726946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:50:58,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:50:58,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 17 [2022-04-15 14:50:58,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:50:58,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866429275] [2022-04-15 14:50:58,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866429275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:50:58,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:50:58,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 14:50:58,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265352304] [2022-04-15 14:50:58,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:50:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 82 [2022-04-15 14:50:58,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:50:58,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 14:50:58,262 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 14:50:58,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 14:50:58,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:50:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 14:50:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-15 14:50:58,263 INFO L87 Difference]: Start difference. First operand 198 states and 260 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 14:51:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:02,192 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-15 14:51:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 14:51:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 82 [2022-04-15 14:51:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:51:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 14:51:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2022-04-15 14:51:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 14:51:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2022-04-15 14:51:02,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 108 transitions. [2022-04-15 14:51:02,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:02,300 INFO L225 Difference]: With dead ends: 212 [2022-04-15 14:51:02,300 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 14:51:02,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-04-15 14:51:02,301 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 14:51:02,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 245 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 451 Invalid, 0 Unknown, 62 Unchecked, 1.3s Time] [2022-04-15 14:51:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 14:51:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-15 14:51:02,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:51:02,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:02,598 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:02,598 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:02,602 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-15 14:51:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-15 14:51:02,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:02,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:02,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-15 14:51:02,603 INFO L87 Difference]: Start difference. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-15 14:51:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:02,606 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-15 14:51:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-15 14:51:02,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:02,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:02,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:51:02,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:51:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-15 14:51:02,618 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-15 14:51:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:51:02,618 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-15 14:51:02,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 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 14:51:02,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-15 14:51:02,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-15 14:51:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 14:51:02,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:51:02,945 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:51:02,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 14:51:03,145 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 14:51:03,146 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:51:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:51:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-15 14:51:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:03,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900741419] [2022-04-15 14:51:03,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:51:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-15 14:51:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:51:03,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003383521] [2022-04-15 14:51:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:51:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:51:03,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:51:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423215879] [2022-04-15 14:51:03,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:51:03,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:51:03,165 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 14:51:03,165 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 14:51:03,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:51:03,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:51:03,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 14:51:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:51:03,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:51:03,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {16583#true} call ULTIMATE.init(); {16583#true} is VALID [2022-04-15 14:51:03,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {16583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {16591#(<= ~counter~0 0)} assume true; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16591#(<= ~counter~0 0)} {16583#true} #98#return; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {16591#(<= ~counter~0 0)} call #t~ret8 := main(); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {16591#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {16591#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {16591#(<= ~counter~0 0)} ~cond := #in~cond; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {16591#(<= ~counter~0 0)} assume !(0 == ~cond); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {16591#(<= ~counter~0 0)} assume true; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16591#(<= ~counter~0 0)} {16591#(<= ~counter~0 0)} #78#return; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,499 INFO L272 TraceCheckUtils]: 11: Hoare triple {16591#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {16591#(<= ~counter~0 0)} ~cond := #in~cond; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {16591#(<= ~counter~0 0)} assume !(0 == ~cond); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {16591#(<= ~counter~0 0)} assume true; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,500 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16591#(<= ~counter~0 0)} {16591#(<= ~counter~0 0)} #80#return; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {16591#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,500 INFO L272 TraceCheckUtils]: 17: Hoare triple {16591#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {16591#(<= ~counter~0 0)} ~cond := #in~cond; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {16591#(<= ~counter~0 0)} assume !(0 == ~cond); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {16591#(<= ~counter~0 0)} assume true; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,502 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16591#(<= ~counter~0 0)} {16591#(<= ~counter~0 0)} #82#return; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,502 INFO L272 TraceCheckUtils]: 22: Hoare triple {16591#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {16591#(<= ~counter~0 0)} ~cond := #in~cond; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {16591#(<= ~counter~0 0)} assume !(0 == ~cond); {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {16591#(<= ~counter~0 0)} assume true; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,503 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16591#(<= ~counter~0 0)} {16591#(<= ~counter~0 0)} #84#return; {16591#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:03,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {16591#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {16670#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {16670#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {16670#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {16680#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,505 INFO L272 TraceCheckUtils]: 32: Hoare triple {16680#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {16680#(<= ~counter~0 2)} ~cond := #in~cond; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {16680#(<= ~counter~0 2)} assume !(0 == ~cond); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {16680#(<= ~counter~0 2)} assume true; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,507 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16680#(<= ~counter~0 2)} {16680#(<= ~counter~0 2)} #86#return; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,507 INFO L272 TraceCheckUtils]: 37: Hoare triple {16680#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {16680#(<= ~counter~0 2)} ~cond := #in~cond; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {16680#(<= ~counter~0 2)} assume !(0 == ~cond); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {16680#(<= ~counter~0 2)} assume true; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,508 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16680#(<= ~counter~0 2)} {16680#(<= ~counter~0 2)} #88#return; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,509 INFO L272 TraceCheckUtils]: 42: Hoare triple {16680#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {16680#(<= ~counter~0 2)} ~cond := #in~cond; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {16680#(<= ~counter~0 2)} assume !(0 == ~cond); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {16680#(<= ~counter~0 2)} assume true; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,510 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16680#(<= ~counter~0 2)} {16680#(<= ~counter~0 2)} #90#return; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,511 INFO L272 TraceCheckUtils]: 47: Hoare triple {16680#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {16680#(<= ~counter~0 2)} ~cond := #in~cond; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {16680#(<= ~counter~0 2)} assume !(0 == ~cond); {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {16680#(<= ~counter~0 2)} assume true; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,512 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16680#(<= ~counter~0 2)} {16680#(<= ~counter~0 2)} #92#return; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {16680#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {16680#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {16750#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,513 INFO L272 TraceCheckUtils]: 55: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {16750#(<= ~counter~0 3)} ~cond := #in~cond; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {16750#(<= ~counter~0 3)} assume !(0 == ~cond); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {16750#(<= ~counter~0 3)} assume true; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,514 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16750#(<= ~counter~0 3)} {16750#(<= ~counter~0 3)} #86#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,515 INFO L272 TraceCheckUtils]: 60: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {16750#(<= ~counter~0 3)} ~cond := #in~cond; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {16750#(<= ~counter~0 3)} assume !(0 == ~cond); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {16750#(<= ~counter~0 3)} assume true; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,516 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16750#(<= ~counter~0 3)} {16750#(<= ~counter~0 3)} #88#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,517 INFO L272 TraceCheckUtils]: 65: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,517 INFO L290 TraceCheckUtils]: 66: Hoare triple {16750#(<= ~counter~0 3)} ~cond := #in~cond; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,517 INFO L290 TraceCheckUtils]: 67: Hoare triple {16750#(<= ~counter~0 3)} assume !(0 == ~cond); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {16750#(<= ~counter~0 3)} assume true; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,518 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16750#(<= ~counter~0 3)} {16750#(<= ~counter~0 3)} #90#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,518 INFO L272 TraceCheckUtils]: 70: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {16750#(<= ~counter~0 3)} ~cond := #in~cond; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {16750#(<= ~counter~0 3)} assume !(0 == ~cond); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {16750#(<= ~counter~0 3)} assume true; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,520 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16750#(<= ~counter~0 3)} {16750#(<= ~counter~0 3)} #92#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {16750#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,520 INFO L290 TraceCheckUtils]: 76: Hoare triple {16750#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,521 INFO L290 TraceCheckUtils]: 77: Hoare triple {16750#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16823#(<= |main_#t~post6| 3)} is VALID [2022-04-15 14:51:03,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {16823#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {16584#false} is VALID [2022-04-15 14:51:03,521 INFO L272 TraceCheckUtils]: 79: Hoare triple {16584#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16584#false} is VALID [2022-04-15 14:51:03,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {16584#false} ~cond := #in~cond; {16584#false} is VALID [2022-04-15 14:51:03,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {16584#false} assume 0 == ~cond; {16584#false} is VALID [2022-04-15 14:51:03,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {16584#false} assume !false; {16584#false} is VALID [2022-04-15 14:51:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 14:51:03,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:51:03,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {16584#false} assume !false; {16584#false} is VALID [2022-04-15 14:51:03,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {16584#false} assume 0 == ~cond; {16584#false} is VALID [2022-04-15 14:51:03,817 INFO L290 TraceCheckUtils]: 80: Hoare triple {16584#false} ~cond := #in~cond; {16584#false} is VALID [2022-04-15 14:51:03,817 INFO L272 TraceCheckUtils]: 79: Hoare triple {16584#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16584#false} is VALID [2022-04-15 14:51:03,817 INFO L290 TraceCheckUtils]: 78: Hoare triple {16851#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {16584#false} is VALID [2022-04-15 14:51:03,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {16855#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16851#(< |main_#t~post6| 5)} is VALID [2022-04-15 14:51:03,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {16855#(< ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {16855#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,819 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16583#true} {16855#(< ~counter~0 5)} #92#return; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,819 INFO L272 TraceCheckUtils]: 70: Hoare triple {16855#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,820 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16583#true} {16855#(< ~counter~0 5)} #90#return; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,820 INFO L272 TraceCheckUtils]: 65: Hoare triple {16855#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,820 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16583#true} {16855#(< ~counter~0 5)} #88#return; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,821 INFO L272 TraceCheckUtils]: 60: Hoare triple {16855#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,821 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16583#true} {16855#(< ~counter~0 5)} #86#return; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,821 INFO L272 TraceCheckUtils]: 55: Hoare triple {16855#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {16855#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {16750#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16855#(< ~counter~0 5)} is VALID [2022-04-15 14:51:03,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {16750#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,823 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16583#true} {16750#(<= ~counter~0 3)} #92#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,824 INFO L272 TraceCheckUtils]: 47: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,824 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16583#true} {16750#(<= ~counter~0 3)} #90#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,824 INFO L272 TraceCheckUtils]: 42: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,825 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16583#true} {16750#(<= ~counter~0 3)} #88#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,825 INFO L272 TraceCheckUtils]: 37: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,825 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16583#true} {16750#(<= ~counter~0 3)} #86#return; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,826 INFO L272 TraceCheckUtils]: 32: Hoare triple {16750#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {16750#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {16680#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16750#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:03,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {16680#(<= ~counter~0 2)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {16680#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {16670#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16680#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:03,828 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16583#true} {16670#(<= ~counter~0 1)} #84#return; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,828 INFO L272 TraceCheckUtils]: 22: Hoare triple {16670#(<= ~counter~0 1)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,829 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16583#true} {16670#(<= ~counter~0 1)} #82#return; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,829 INFO L272 TraceCheckUtils]: 17: Hoare triple {16670#(<= ~counter~0 1)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {16670#(<= ~counter~0 1)} ~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; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,829 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16583#true} {16670#(<= ~counter~0 1)} #80#return; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {16670#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16583#true} {16670#(<= ~counter~0 1)} #78#return; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-15 14:51:03,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {16670#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16583#true} is VALID [2022-04-15 14:51:03,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {16670#(<= ~counter~0 1)} 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; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {16670#(<= ~counter~0 1)} call #t~ret8 := main(); {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16670#(<= ~counter~0 1)} {16583#true} #98#return; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {16670#(<= ~counter~0 1)} assume true; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {16583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16670#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:03,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {16583#true} call ULTIMATE.init(); {16583#true} is VALID [2022-04-15 14:51:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 14:51:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:51:03,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003383521] [2022-04-15 14:51:03,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:51:03,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423215879] [2022-04-15 14:51:03,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423215879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:51:03,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:51:03,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 14:51:03,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:51:03,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900741419] [2022-04-15 14:51:03,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900741419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:51:03,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:51:03,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:51:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183418069] [2022-04-15 14:51:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:51:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-15 14:51:03,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:51:03,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:03,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:03,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:51:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:51:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:51:03,872 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:04,397 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-15 14:51:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:51:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-15 14:51:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:51:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 14:51:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 14:51:04,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 14:51:04,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:04,467 INFO L225 Difference]: With dead ends: 214 [2022-04-15 14:51:04,467 INFO L226 Difference]: Without dead ends: 206 [2022-04-15 14:51:04,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:51:04,469 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:51:04,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 187 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:51:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-15 14:51:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-15 14:51:04,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:51:04,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:04,764 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:04,765 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:04,768 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-15 14:51:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-15 14:51:04,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:04,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:04,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-15 14:51:04,769 INFO L87 Difference]: Start difference. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-15 14:51:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:04,772 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-15 14:51:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-15 14:51:04,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:04,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:04,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:51:04,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:51:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-15 14:51:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-15 14:51:04,777 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-15 14:51:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:51:04,777 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-15 14:51:04,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:04,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-15 14:51:05,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-15 14:51:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 14:51:05,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:51:05,088 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:51:05,109 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 14:51:05,288 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 14:51:05,289 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:51:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:51:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-15 14:51:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:05,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12986772] [2022-04-15 14:51:05,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:51:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-15 14:51:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:51:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513373698] [2022-04-15 14:51:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:51:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:51:05,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:51:05,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938281881] [2022-04-15 14:51:05,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:51:05,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:51:05,299 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 14:51:05,300 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 14:51:05,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:51:05,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:51:05,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 14:51:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:51:05,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:51:05,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {18345#true} call ULTIMATE.init(); {18345#true} is VALID [2022-04-15 14:51:05,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {18345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18345#true} {18345#true} #98#return; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {18345#true} call #t~ret8 := main(); {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {18345#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; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {18345#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18345#true} {18345#true} #78#return; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {18345#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18345#true} {18345#true} #80#return; {18345#true} is VALID [2022-04-15 14:51:05,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {18345#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; {18398#(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 14:51:05,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {18398#(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)); {18345#true} is VALID [2022-04-15 14:51:05,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,916 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18345#true} {18398#(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; {18398#(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 14:51:05,916 INFO L272 TraceCheckUtils]: 22: Hoare triple {18398#(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)); {18345#true} is VALID [2022-04-15 14:51:05,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,922 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18345#true} {18398#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {18398#(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 14:51:05,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {18398#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18398#(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 14:51:05,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {18398#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {18398#(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 14:51:05,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {18398#(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; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,924 INFO L272 TraceCheckUtils]: 32: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,925 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18345#true} {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,925 INFO L272 TraceCheckUtils]: 37: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,926 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18345#true} {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,926 INFO L272 TraceCheckUtils]: 42: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,927 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18345#true} {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,927 INFO L272 TraceCheckUtils]: 47: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,928 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18345#true} {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {18438#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,929 INFO L272 TraceCheckUtils]: 55: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,930 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18345#true} {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,930 INFO L272 TraceCheckUtils]: 60: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,930 INFO L290 TraceCheckUtils]: 61: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,930 INFO L290 TraceCheckUtils]: 63: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,931 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18345#true} {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #88#return; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,931 INFO L272 TraceCheckUtils]: 65: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:05,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,932 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18345#true} {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,932 INFO L272 TraceCheckUtils]: 70: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} 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)); {18345#true} is VALID [2022-04-15 14:51:05,932 INFO L290 TraceCheckUtils]: 71: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:05,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:05,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:05,933 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18345#true} {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,933 INFO L290 TraceCheckUtils]: 75: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 14:51:05,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {18508#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18581#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 14:51:05,934 INFO L290 TraceCheckUtils]: 77: Hoare triple {18581#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18581#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 14:51:05,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {18581#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {18581#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 14:51:05,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {18581#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18591#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 14:51:05,935 INFO L272 TraceCheckUtils]: 80: Hoare triple {18591#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 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)); {18595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:51:05,936 INFO L290 TraceCheckUtils]: 81: Hoare triple {18595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:05,936 INFO L290 TraceCheckUtils]: 82: Hoare triple {18599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18346#false} is VALID [2022-04-15 14:51:05,936 INFO L290 TraceCheckUtils]: 83: Hoare triple {18346#false} assume !false; {18346#false} is VALID [2022-04-15 14:51:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 14:51:05,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:51:06,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {18346#false} assume !false; {18346#false} is VALID [2022-04-15 14:51:06,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {18599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18346#false} is VALID [2022-04-15 14:51:06,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {18595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:06,440 INFO L272 TraceCheckUtils]: 80: Hoare triple {18615#(= (+ (* 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)); {18595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:51:06,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {18619#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {18615#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-15 14:51:06,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {18619#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {18619#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 14:51:06,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {18619#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18619#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 14:51:07,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {18629#(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; {18619#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 14:51:07,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {18629#(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))} assume !(~c~0 >= ~b~0); {18629#(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 14:51:07,425 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18345#true} {18629#(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))} #92#return; {18629#(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 14:51:07,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,425 INFO L272 TraceCheckUtils]: 70: Hoare triple {18629#(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))} 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)); {18345#true} is VALID [2022-04-15 14:51:07,426 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18345#true} {18629#(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))} #90#return; {18629#(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 14:51:07,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,426 INFO L272 TraceCheckUtils]: 65: Hoare triple {18629#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,426 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18345#true} {18629#(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))} #88#return; {18629#(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 14:51:07,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,427 INFO L272 TraceCheckUtils]: 60: Hoare triple {18629#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,427 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18345#true} {18629#(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))} #86#return; {18629#(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 14:51:07,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,428 INFO L272 TraceCheckUtils]: 55: Hoare triple {18629#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {18629#(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))} assume !!(#t~post7 < 5);havoc #t~post7; {18629#(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 14:51:07,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {18629#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18629#(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 14:51:07,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18629#(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 14:51:07,880 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18345#true} {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #92#return; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,881 INFO L272 TraceCheckUtils]: 47: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 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)); {18345#true} is VALID [2022-04-15 14:51:07,881 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18345#true} {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #90#return; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,882 INFO L272 TraceCheckUtils]: 42: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,882 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18345#true} {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #88#return; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,883 INFO L272 TraceCheckUtils]: 37: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,883 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18345#true} {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #86#return; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,884 INFO L272 TraceCheckUtils]: 32: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18702#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-15 14:51:07,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-15 14:51:07,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-15 14:51:07,887 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18345#true} {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #84#return; {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-15 14:51:07,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,887 INFO L272 TraceCheckUtils]: 22: Hoare triple {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,888 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18345#true} {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #82#return; {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-15 14:51:07,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,888 INFO L272 TraceCheckUtils]: 17: Hoare triple {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {18345#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; {18772#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-15 14:51:07,889 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18345#true} {18345#true} #80#return; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L272 TraceCheckUtils]: 11: Hoare triple {18345#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18345#true} {18345#true} #78#return; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {18345#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {18345#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; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {18345#true} call #t~ret8 := main(); {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18345#true} {18345#true} #98#return; {18345#true} is VALID [2022-04-15 14:51:07,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 14:51:07,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {18345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18345#true} is VALID [2022-04-15 14:51:07,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {18345#true} call ULTIMATE.init(); {18345#true} is VALID [2022-04-15 14:51:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 14:51:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:51:07,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513373698] [2022-04-15 14:51:07,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:51:07,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938281881] [2022-04-15 14:51:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938281881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:51:07,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:51:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 14:51:07,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:51:07,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12986772] [2022-04-15 14:51:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12986772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:51:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:51:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:51:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182347424] [2022-04-15 14:51:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:51:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-15 14:51:07,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:51:07,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:07,937 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 14:51:07,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 14:51:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 14:51:07,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 14:51:07,938 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:09,337 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-15 14:51:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:51:09,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-15 14:51:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:51:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 14:51:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 14:51:09,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-15 14:51:09,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:09,501 INFO L225 Difference]: With dead ends: 234 [2022-04-15 14:51:09,501 INFO L226 Difference]: Without dead ends: 232 [2022-04-15 14:51:09,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-15 14:51:09,502 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 14:51:09,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 14:51:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-15 14:51:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-15 14:51:09,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:51:09,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-15 14:51:09,839 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-15 14:51:09,840 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-15 14:51:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:09,848 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-15 14:51:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-15 14:51:09,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:09,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:09,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-15 14:51:09,849 INFO L87 Difference]: Start difference. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-15 14:51:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:09,853 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-15 14:51:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-15 14:51:09,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:09,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:09,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:51:09,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:51:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-15 14:51:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-15 14:51:09,860 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-15 14:51:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:51:09,860 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-15 14:51:09,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:09,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-15 14:51:10,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-15 14:51:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 14:51:10,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:51:10,262 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:51:10,286 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 14:51:10,462 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 14:51:10,462 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:51:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:51:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-15 14:51:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:10,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1839840404] [2022-04-15 14:51:10,463 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:51:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-15 14:51:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:51:10,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987148085] [2022-04-15 14:51:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:51:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:51:10,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:51:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433365060] [2022-04-15 14:51:10,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 14:51:10,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:10,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:51:10,474 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 14:51:10,480 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 14:51:10,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 14:51:10,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:51:10,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:51:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:51:10,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:51:10,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {20260#true} call ULTIMATE.init(); {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {20260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20260#true} {20260#true} #98#return; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {20260#true} call #t~ret8 := main(); {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {20260#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; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {20260#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20260#true} {20260#true} #78#return; {20260#true} is VALID [2022-04-15 14:51:10,729 INFO L272 TraceCheckUtils]: 11: Hoare triple {20260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20260#true} {20260#true} #80#return; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {20260#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; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L272 TraceCheckUtils]: 17: Hoare triple {20260#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20260#true} {20260#true} #82#return; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L272 TraceCheckUtils]: 22: Hoare triple {20260#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,730 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20260#true} {20260#true} #84#return; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {20260#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {20260#true} assume !!(#t~post6 < 5);havoc #t~post6; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {20260#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {20260#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {20260#true} assume !!(#t~post7 < 5);havoc #t~post7; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L272 TraceCheckUtils]: 32: Hoare triple {20260#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20260#true} {20260#true} #86#return; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L272 TraceCheckUtils]: 37: Hoare triple {20260#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20260#true} {20260#true} #88#return; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L272 TraceCheckUtils]: 42: Hoare triple {20260#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20260#true} {20260#true} #90#return; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L272 TraceCheckUtils]: 47: Hoare triple {20260#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)); {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20260#true} {20260#true} #92#return; {20260#true} is VALID [2022-04-15 14:51:10,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {20260#true} assume !(~c~0 >= ~b~0); {20421#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 14:51:10,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {20421#(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; {20425#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 14:51:10,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {20425#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20425#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 14:51:10,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {20425#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {20425#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 14:51:10,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {20425#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {20435#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {20435#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,734 INFO L272 TraceCheckUtils]: 59: Hoare triple {20435#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,735 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20260#true} {20435#(< main_~b~0 main_~c~0)} #86#return; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,735 INFO L272 TraceCheckUtils]: 64: Hoare triple {20435#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,735 INFO L290 TraceCheckUtils]: 65: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,735 INFO L290 TraceCheckUtils]: 66: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,736 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20260#true} {20435#(< main_~b~0 main_~c~0)} #88#return; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,736 INFO L272 TraceCheckUtils]: 69: Hoare triple {20435#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20260#true} is VALID [2022-04-15 14:51:10,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,736 INFO L290 TraceCheckUtils]: 72: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,736 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20260#true} {20435#(< main_~b~0 main_~c~0)} #90#return; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,737 INFO L272 TraceCheckUtils]: 74: Hoare triple {20435#(< 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)); {20260#true} is VALID [2022-04-15 14:51:10,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {20260#true} ~cond := #in~cond; {20260#true} is VALID [2022-04-15 14:51:10,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {20260#true} assume !(0 == ~cond); {20260#true} is VALID [2022-04-15 14:51:10,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {20260#true} assume true; {20260#true} is VALID [2022-04-15 14:51:10,737 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20260#true} {20435#(< main_~b~0 main_~c~0)} #92#return; {20435#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {20435#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {20261#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; {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {20261#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {20261#false} assume !(#t~post6 < 5);havoc #t~post6; {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L272 TraceCheckUtils]: 83: Hoare triple {20261#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 84: Hoare triple {20261#false} ~cond := #in~cond; {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {20261#false} assume 0 == ~cond; {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {20261#false} assume !false; {20261#false} is VALID [2022-04-15 14:51:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 14:51:10,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:51:10,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:51:10,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987148085] [2022-04-15 14:51:10,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:51:10,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433365060] [2022-04-15 14:51:10,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433365060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:51:10,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:51:10,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:51:10,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:51:10,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1839840404] [2022-04-15 14:51:10,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1839840404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:51:10,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:51:10,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:51:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008781389] [2022-04-15 14:51:10,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:51:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-15 14:51:10,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:51:10,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:51:10,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:10,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:51:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:51:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:51:10,778 INFO L87 Difference]: Start difference. First operand 229 states and 306 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:51:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:11,496 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-15 14:51:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:51:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-15 14:51:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:51:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:51:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-15 14:51:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:51:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-15 14:51:11,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-15 14:51:11,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:11,607 INFO L225 Difference]: With dead ends: 371 [2022-04-15 14:51:11,607 INFO L226 Difference]: Without dead ends: 291 [2022-04-15 14:51:11,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 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 14:51:11,608 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:51:11,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:51:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-15 14:51:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-15 14:51:12,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:51:12,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 14:51:12,071 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 14:51:12,072 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 14:51:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:12,079 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-15 14:51:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-15 14:51:12,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:12,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:12,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-15 14:51:12,081 INFO L87 Difference]: Start difference. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-15 14:51:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:12,090 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-15 14:51:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-15 14:51:12,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:12,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:12,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:51:12,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:51:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 14:51:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-15 14:51:12,099 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-15 14:51:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:51:12,100 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-15 14:51:12,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:51:12,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-15 14:51:12,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-15 14:51:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 14:51:12,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:51:12,566 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:51:12,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 14:51:12,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:12,767 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:51:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:51:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-15 14:51:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:12,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958097828] [2022-04-15 14:51:12,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:51:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-15 14:51:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:51:12,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312961459] [2022-04-15 14:51:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:51:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:51:12,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:51:12,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796728990] [2022-04-15 14:51:12,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:51:12,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:12,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:51:12,778 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:51:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 14:51:12,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:51:12,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:51:12,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 14:51:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:51:12,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:51:13,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {22368#true} call ULTIMATE.init(); {22368#true} is VALID [2022-04-15 14:51:13,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {22368#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22368#true} is VALID [2022-04-15 14:51:13,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22368#true} {22368#true} #98#return; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {22368#true} call #t~ret8 := main(); {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {22368#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; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {22368#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22368#true} {22368#true} #78#return; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {22368#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,060 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22368#true} {22368#true} #80#return; {22368#true} is VALID [2022-04-15 14:51:13,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {22368#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; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,061 INFO L272 TraceCheckUtils]: 17: Hoare triple {22421#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,061 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #82#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {22421#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,062 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #84#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {22421#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {22421#(= main_~q~0 0)} assume !!(#t~post6 < 5);havoc #t~post6; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {22421#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {22421#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {22421#(= main_~q~0 0)} assume !!(#t~post7 < 5);havoc #t~post7; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,063 INFO L272 TraceCheckUtils]: 32: Hoare triple {22421#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,064 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #86#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,064 INFO L272 TraceCheckUtils]: 37: Hoare triple {22421#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,065 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #88#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,065 INFO L272 TraceCheckUtils]: 42: Hoare triple {22421#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,066 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #90#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,066 INFO L272 TraceCheckUtils]: 47: Hoare triple {22421#(= 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)); {22368#true} is VALID [2022-04-15 14:51:13,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,066 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #92#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {22421#(= main_~q~0 0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {22421#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {22421#(= main_~q~0 0)} assume !!(#t~post7 < 5);havoc #t~post7; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,067 INFO L272 TraceCheckUtils]: 55: Hoare triple {22421#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,068 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #86#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,068 INFO L272 TraceCheckUtils]: 60: Hoare triple {22421#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,068 INFO L290 TraceCheckUtils]: 62: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,069 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22368#true} {22421#(= main_~q~0 0)} #88#return; {22421#(= main_~q~0 0)} is VALID [2022-04-15 14:51:13,069 INFO L272 TraceCheckUtils]: 65: Hoare triple {22421#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,069 INFO L290 TraceCheckUtils]: 66: Hoare triple {22368#true} ~cond := #in~cond; {22572#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:13,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {22572#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:13,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:13,070 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} {22421#(= main_~q~0 0)} #90#return; {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-15 14:51:13,070 INFO L272 TraceCheckUtils]: 70: Hoare triple {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {22368#true} is VALID [2022-04-15 14:51:13,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,071 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22368#true} {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #92#return; {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-15 14:51:13,071 INFO L290 TraceCheckUtils]: 75: Hoare triple {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-15 14:51:13,072 INFO L290 TraceCheckUtils]: 76: Hoare triple {22583#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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; {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 14:51:13,072 INFO L290 TraceCheckUtils]: 77: Hoare triple {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 14:51:13,073 INFO L290 TraceCheckUtils]: 78: Hoare triple {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !!(#t~post6 < 5);havoc #t~post6; {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 14:51:13,073 INFO L290 TraceCheckUtils]: 79: Hoare triple {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !(0 != ~b~0); {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 14:51:13,073 INFO L272 TraceCheckUtils]: 80: Hoare triple {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:13,073 INFO L290 TraceCheckUtils]: 81: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:13,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:13,073 INFO L290 TraceCheckUtils]: 83: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:13,074 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22368#true} {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #94#return; {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 14:51:13,074 INFO L272 TraceCheckUtils]: 85: Hoare triple {22605#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:51:13,075 INFO L290 TraceCheckUtils]: 86: Hoare triple {22633#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:13,075 INFO L290 TraceCheckUtils]: 87: Hoare triple {22637#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22369#false} is VALID [2022-04-15 14:51:13,075 INFO L290 TraceCheckUtils]: 88: Hoare triple {22369#false} assume !false; {22369#false} is VALID [2022-04-15 14:51:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-15 14:51:13,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:51:30,910 INFO L290 TraceCheckUtils]: 88: Hoare triple {22369#false} assume !false; {22369#false} is VALID [2022-04-15 14:51:30,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {22637#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22369#false} is VALID [2022-04-15 14:51:30,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {22633#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:30,911 INFO L272 TraceCheckUtils]: 85: Hoare triple {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:51:30,912 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22368#true} {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #94#return; {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:51:30,912 INFO L290 TraceCheckUtils]: 83: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,912 INFO L290 TraceCheckUtils]: 82: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,912 INFO L290 TraceCheckUtils]: 81: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,912 INFO L272 TraceCheckUtils]: 80: Hoare triple {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:51:30,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:51:30,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:51:30,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {22681#(= 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; {22653#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 14:51:30,914 INFO L290 TraceCheckUtils]: 75: Hoare triple {22681#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {22681#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:51:30,915 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22368#true} {22681#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {22681#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:51:30,915 INFO L290 TraceCheckUtils]: 73: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,915 INFO L290 TraceCheckUtils]: 72: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,915 INFO L290 TraceCheckUtils]: 71: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,915 INFO L272 TraceCheckUtils]: 70: Hoare triple {22681#(= 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)); {22368#true} is VALID [2022-04-15 14:51:30,916 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} {22368#true} #90#return; {22681#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 14:51:30,916 INFO L290 TraceCheckUtils]: 68: Hoare triple {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:30,916 INFO L290 TraceCheckUtils]: 67: Hoare triple {22712#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:30,916 INFO L290 TraceCheckUtils]: 66: Hoare triple {22368#true} ~cond := #in~cond; {22712#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:51:30,917 INFO L272 TraceCheckUtils]: 65: Hoare triple {22368#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22368#true} {22368#true} #88#return; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L272 TraceCheckUtils]: 60: Hoare triple {22368#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22368#true} {22368#true} #86#return; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L272 TraceCheckUtils]: 55: Hoare triple {22368#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {22368#true} assume !!(#t~post7 < 5);havoc #t~post7; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {22368#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {22368#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22368#true} is VALID [2022-04-15 14:51:30,917 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22368#true} {22368#true} #92#return; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L272 TraceCheckUtils]: 47: Hoare triple {22368#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)); {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22368#true} {22368#true} #90#return; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L272 TraceCheckUtils]: 42: Hoare triple {22368#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22368#true} {22368#true} #88#return; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,918 INFO L272 TraceCheckUtils]: 37: Hoare triple {22368#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22368#true} {22368#true} #86#return; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L272 TraceCheckUtils]: 32: Hoare triple {22368#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {22368#true} assume !!(#t~post7 < 5);havoc #t~post7; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {22368#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {22368#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {22368#true} assume !!(#t~post6 < 5);havoc #t~post6; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {22368#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22368#true} {22368#true} #84#return; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,919 INFO L272 TraceCheckUtils]: 22: Hoare triple {22368#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22368#true} {22368#true} #82#return; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L272 TraceCheckUtils]: 17: Hoare triple {22368#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {22368#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; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22368#true} {22368#true} #80#return; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L272 TraceCheckUtils]: 11: Hoare triple {22368#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22368#true} {22368#true} #78#return; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {22368#true} assume !(0 == ~cond); {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {22368#true} ~cond := #in~cond; {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {22368#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {22368#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; {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {22368#true} call #t~ret8 := main(); {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22368#true} {22368#true} #98#return; {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {22368#true} assume true; {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {22368#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {22368#true} call ULTIMATE.init(); {22368#true} is VALID [2022-04-15 14:51:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-15 14:51:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:51:30,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312961459] [2022-04-15 14:51:30,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:51:30,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796728990] [2022-04-15 14:51:30,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796728990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:51:30,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:51:30,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-15 14:51:30,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:51:30,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958097828] [2022-04-15 14:51:30,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958097828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:51:30,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:51:30,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:51:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032370604] [2022-04-15 14:51:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:51:30,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-15 14:51:30,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:51:30,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 14:51:30,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:30,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 14:51:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 14:51:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:51:30,963 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 14:51:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:32,180 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-15 14:51:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:51:32,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-15 14:51:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:51:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 14:51:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-15 14:51:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 14:51:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-15 14:51:32,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-15 14:51:32,265 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 14:51:32,271 INFO L225 Difference]: With dead ends: 301 [2022-04-15 14:51:32,271 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 14:51:32,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-15 14:51:32,272 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 14:51:32,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 226 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 14:51:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 14:51:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-15 14:51:32,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:51:32,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-15 14:51:32,692 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-15 14:51:32,692 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-15 14:51:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:32,699 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-15 14:51:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-15 14:51:32,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:32,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:32,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-15 14:51:32,700 INFO L87 Difference]: Start difference. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-15 14:51:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:32,707 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-15 14:51:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-15 14:51:32,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:32,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:32,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:51:32,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:51:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-15 14:51:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-15 14:51:32,716 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-15 14:51:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:51:32,717 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-15 14:51:32,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 14:51:32,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-15 14:51:33,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-15 14:51:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 14:51:33,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:51:33,219 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:51:33,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 14:51:33,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 14:51:33,435 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:51:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:51:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-15 14:51:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [38127335] [2022-04-15 14:51:33,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:51:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-15 14:51:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:51:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647515472] [2022-04-15 14:51:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:51:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:51:33,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:51:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449428059] [2022-04-15 14:51:33,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:51:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:51:33,447 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:51:33,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 14:51:33,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:51:33,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:51:33,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 14:51:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:51:33,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:51:33,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {24699#true} call ULTIMATE.init(); {24699#true} is VALID [2022-04-15 14:51:33,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {24699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {24707#(<= ~counter~0 0)} assume true; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24707#(<= ~counter~0 0)} {24699#true} #98#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {24707#(<= ~counter~0 0)} call #t~ret8 := main(); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {24707#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {24707#(<= ~counter~0 0)} ~cond := #in~cond; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {24707#(<= ~counter~0 0)} assume !(0 == ~cond); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {24707#(<= ~counter~0 0)} assume true; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24707#(<= ~counter~0 0)} {24707#(<= ~counter~0 0)} #78#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,838 INFO L272 TraceCheckUtils]: 11: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {24707#(<= ~counter~0 0)} ~cond := #in~cond; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {24707#(<= ~counter~0 0)} assume !(0 == ~cond); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {24707#(<= ~counter~0 0)} assume true; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,839 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24707#(<= ~counter~0 0)} {24707#(<= ~counter~0 0)} #80#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {24707#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,840 INFO L272 TraceCheckUtils]: 17: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {24707#(<= ~counter~0 0)} ~cond := #in~cond; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {24707#(<= ~counter~0 0)} assume !(0 == ~cond); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {24707#(<= ~counter~0 0)} assume true; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,841 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24707#(<= ~counter~0 0)} {24707#(<= ~counter~0 0)} #82#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,843 INFO L272 TraceCheckUtils]: 22: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {24707#(<= ~counter~0 0)} ~cond := #in~cond; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {24707#(<= ~counter~0 0)} assume !(0 == ~cond); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {24707#(<= ~counter~0 0)} assume true; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,844 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24707#(<= ~counter~0 0)} {24707#(<= ~counter~0 0)} #84#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:33,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {24707#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24786#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:33,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {24786#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {24786#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:33,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {24786#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24786#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:33,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {24786#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {24796#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,847 INFO L272 TraceCheckUtils]: 32: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {24796#(<= ~counter~0 2)} ~cond := #in~cond; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {24796#(<= ~counter~0 2)} assume !(0 == ~cond); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {24796#(<= ~counter~0 2)} assume true; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,848 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24796#(<= ~counter~0 2)} {24796#(<= ~counter~0 2)} #86#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,848 INFO L272 TraceCheckUtils]: 37: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {24796#(<= ~counter~0 2)} ~cond := #in~cond; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {24796#(<= ~counter~0 2)} assume !(0 == ~cond); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {24796#(<= ~counter~0 2)} assume true; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,850 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24796#(<= ~counter~0 2)} {24796#(<= ~counter~0 2)} #88#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,850 INFO L272 TraceCheckUtils]: 42: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {24796#(<= ~counter~0 2)} ~cond := #in~cond; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {24796#(<= ~counter~0 2)} assume !(0 == ~cond); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {24796#(<= ~counter~0 2)} assume true; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,851 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24796#(<= ~counter~0 2)} {24796#(<= ~counter~0 2)} #90#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,852 INFO L272 TraceCheckUtils]: 47: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {24796#(<= ~counter~0 2)} ~cond := #in~cond; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {24796#(<= ~counter~0 2)} assume !(0 == ~cond); {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {24796#(<= ~counter~0 2)} assume true; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,853 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24796#(<= ~counter~0 2)} {24796#(<= ~counter~0 2)} #92#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {24796#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:33,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {24796#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {24866#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,855 INFO L272 TraceCheckUtils]: 55: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {24866#(<= ~counter~0 3)} ~cond := #in~cond; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {24866#(<= ~counter~0 3)} assume !(0 == ~cond); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {24866#(<= ~counter~0 3)} assume true; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,856 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24866#(<= ~counter~0 3)} {24866#(<= ~counter~0 3)} #86#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,857 INFO L272 TraceCheckUtils]: 60: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {24866#(<= ~counter~0 3)} ~cond := #in~cond; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {24866#(<= ~counter~0 3)} assume !(0 == ~cond); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {24866#(<= ~counter~0 3)} assume true; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,858 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24866#(<= ~counter~0 3)} {24866#(<= ~counter~0 3)} #88#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,858 INFO L272 TraceCheckUtils]: 65: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {24866#(<= ~counter~0 3)} ~cond := #in~cond; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {24866#(<= ~counter~0 3)} assume !(0 == ~cond); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {24866#(<= ~counter~0 3)} assume true; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,860 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24866#(<= ~counter~0 3)} {24866#(<= ~counter~0 3)} #90#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,860 INFO L272 TraceCheckUtils]: 70: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {24866#(<= ~counter~0 3)} ~cond := #in~cond; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {24866#(<= ~counter~0 3)} assume !(0 == ~cond); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {24866#(<= ~counter~0 3)} assume true; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,862 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24866#(<= ~counter~0 3)} {24866#(<= ~counter~0 3)} #92#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {24866#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {24866#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:33,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {24866#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24939#(<= ~counter~0 4)} is VALID [2022-04-15 14:51:33,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {24939#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {24939#(<= ~counter~0 4)} is VALID [2022-04-15 14:51:33,863 INFO L290 TraceCheckUtils]: 79: Hoare triple {24939#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24939#(<= ~counter~0 4)} is VALID [2022-04-15 14:51:33,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {24939#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24949#(<= |main_#t~post7| 4)} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {24949#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {24700#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; {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {24700#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {24700#false} assume !(#t~post6 < 5);havoc #t~post6; {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L272 TraceCheckUtils]: 85: Hoare triple {24700#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {24700#false} ~cond := #in~cond; {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 87: Hoare triple {24700#false} assume 0 == ~cond; {24700#false} is VALID [2022-04-15 14:51:33,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {24700#false} assume !false; {24700#false} is VALID [2022-04-15 14:51:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 14:51:33,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:51:34,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {24700#false} assume !false; {24700#false} is VALID [2022-04-15 14:51:34,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {24700#false} assume 0 == ~cond; {24700#false} is VALID [2022-04-15 14:51:34,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {24700#false} ~cond := #in~cond; {24700#false} is VALID [2022-04-15 14:51:34,144 INFO L272 TraceCheckUtils]: 85: Hoare triple {24700#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24700#false} is VALID [2022-04-15 14:51:34,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {24700#false} assume !(#t~post6 < 5);havoc #t~post6; {24700#false} is VALID [2022-04-15 14:51:34,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {24700#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24700#false} is VALID [2022-04-15 14:51:34,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {24700#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; {24700#false} is VALID [2022-04-15 14:51:34,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {24949#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {24700#false} is VALID [2022-04-15 14:51:34,144 INFO L290 TraceCheckUtils]: 80: Hoare triple {24939#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24949#(<= |main_#t~post7| 4)} is VALID [2022-04-15 14:51:34,145 INFO L290 TraceCheckUtils]: 79: Hoare triple {24939#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24939#(<= ~counter~0 4)} is VALID [2022-04-15 14:51:34,145 INFO L290 TraceCheckUtils]: 78: Hoare triple {24939#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {24939#(<= ~counter~0 4)} is VALID [2022-04-15 14:51:34,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {24866#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24939#(<= ~counter~0 4)} is VALID [2022-04-15 14:51:34,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {24866#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {24866#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,147 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24699#true} {24866#(<= ~counter~0 3)} #92#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,147 INFO L290 TraceCheckUtils]: 73: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,147 INFO L290 TraceCheckUtils]: 72: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,147 INFO L290 TraceCheckUtils]: 71: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,147 INFO L272 TraceCheckUtils]: 70: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,148 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24699#true} {24866#(<= ~counter~0 3)} #90#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,148 INFO L272 TraceCheckUtils]: 65: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,148 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24699#true} {24866#(<= ~counter~0 3)} #88#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L272 TraceCheckUtils]: 60: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24699#true} {24866#(<= ~counter~0 3)} #86#return; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,149 INFO L272 TraceCheckUtils]: 55: Hoare triple {24866#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {24866#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {24796#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24866#(<= ~counter~0 3)} is VALID [2022-04-15 14:51:34,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {24796#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,151 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24699#true} {24796#(<= ~counter~0 2)} #92#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,151 INFO L272 TraceCheckUtils]: 47: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,152 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24699#true} {24796#(<= ~counter~0 2)} #90#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,152 INFO L272 TraceCheckUtils]: 42: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,153 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24699#true} {24796#(<= ~counter~0 2)} #88#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,153 INFO L272 TraceCheckUtils]: 37: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,153 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24699#true} {24796#(<= ~counter~0 2)} #86#return; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,154 INFO L272 TraceCheckUtils]: 32: Hoare triple {24796#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {24796#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {24786#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24796#(<= ~counter~0 2)} is VALID [2022-04-15 14:51:34,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {24786#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24786#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:34,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {24786#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {24786#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:34,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {24707#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24786#(<= ~counter~0 1)} is VALID [2022-04-15 14:51:34,156 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24699#true} {24707#(<= ~counter~0 0)} #84#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,156 INFO L272 TraceCheckUtils]: 22: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,156 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24699#true} {24707#(<= ~counter~0 0)} #82#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,157 INFO L272 TraceCheckUtils]: 17: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {24707#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,157 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24699#true} {24707#(<= ~counter~0 0)} #80#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24699#true} {24707#(<= ~counter~0 0)} #78#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {24699#true} assume true; {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {24699#true} assume !(0 == ~cond); {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {24699#true} ~cond := #in~cond; {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {24707#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24699#true} is VALID [2022-04-15 14:51:34,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {24707#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {24707#(<= ~counter~0 0)} call #t~ret8 := main(); {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24707#(<= ~counter~0 0)} {24699#true} #98#return; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {24707#(<= ~counter~0 0)} assume true; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {24699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24707#(<= ~counter~0 0)} is VALID [2022-04-15 14:51:34,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {24699#true} call ULTIMATE.init(); {24699#true} is VALID [2022-04-15 14:51:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 14:51:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:51:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647515472] [2022-04-15 14:51:34,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:51:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449428059] [2022-04-15 14:51:34,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449428059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:51:34,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:51:34,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 14:51:34,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:51:34,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [38127335] [2022-04-15 14:51:34,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [38127335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:51:34,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:51:34,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:51:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918207427] [2022-04-15 14:51:34,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:51:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-15 14:51:34,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:51:34,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:34,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:34,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:51:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:34,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:51:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:51:34,212 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:35,066 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-15 14:51:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 14:51:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-15 14:51:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:51:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-15 14:51:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-15 14:51:35,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-15 14:51:35,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:35,174 INFO L225 Difference]: With dead ends: 463 [2022-04-15 14:51:35,174 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 14:51:35,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:51:35,175 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 46 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:51:35,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 171 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:51:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 14:51:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-15 14:51:35,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:51:35,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:51:35,707 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:51:35,708 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:51:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:35,714 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-15 14:51:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-15 14:51:35,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:35,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:35,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-15 14:51:35,715 INFO L87 Difference]: Start difference. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-15 14:51:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:51:35,721 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-15 14:51:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-15 14:51:35,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:51:35,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:51:35,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:51:35,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:51:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:51:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-15 14:51:35,732 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-15 14:51:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:51:35,732 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-15 14:51:35,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 14:51:35,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-15 14:51:36,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:51:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-15 14:51:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 14:51:36,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:51:36,311 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:51:36,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 14:51:36,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 14:51:36,512 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:51:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:51:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-15 14:51:36,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:51:36,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002408707] [2022-04-15 14:51:36,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:51:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-15 14:51:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:51:36,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004324891] [2022-04-15 14:51:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:51:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:51:36,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:51:36,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940058106] [2022-04-15 14:51:36,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:51:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:51:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:51:36,530 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:51:36,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 14:51:36,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:51:36,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:51:36,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-15 14:51:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:51:36,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:51:40,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {27484#true} call ULTIMATE.init(); {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {27484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27484#true} {27484#true} #98#return; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {27484#true} call #t~ret8 := main(); {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {27484#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; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {27484#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27484#true} {27484#true} #78#return; {27484#true} is VALID [2022-04-15 14:51:40,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {27484#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {27484#true} ~cond := #in~cond; {27525#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:51:40,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {27525#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27529#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:51:40,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {27529#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27529#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:51:40,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27529#(not (= |assume_abort_if_not_#in~cond| 0))} {27484#true} #80#return; {27536#(<= 1 main_~y~0)} is VALID [2022-04-15 14:51:40,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {27536#(<= 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; {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,681 INFO L272 TraceCheckUtils]: 17: Hoare triple {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,682 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27484#true} {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,682 INFO L272 TraceCheckUtils]: 22: Hoare triple {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,683 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27484#true} {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {27540#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,685 INFO L272 TraceCheckUtils]: 32: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,686 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27484#true} {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,687 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27484#true} {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #88#return; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,687 INFO L272 TraceCheckUtils]: 42: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,688 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27484#true} {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #90#return; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,688 INFO L272 TraceCheckUtils]: 47: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} 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)); {27484#true} is VALID [2022-04-15 14:51:40,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,689 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {27484#true} {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #92#return; {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {27580#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 14:51:40,691 INFO L272 TraceCheckUtils]: 55: Hoare triple {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {27484#true} ~cond := #in~cond; {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:40,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,693 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} {27650#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:51:40,693 INFO L272 TraceCheckUtils]: 60: Hoare triple {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,694 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27484#true} {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:51:40,694 INFO L272 TraceCheckUtils]: 65: Hoare triple {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {27484#true} ~cond := #in~cond; {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:40,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,696 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:51:40,696 INFO L272 TraceCheckUtils]: 70: Hoare triple {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} 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)); {27484#true} is VALID [2022-04-15 14:51:40,696 INFO L290 TraceCheckUtils]: 71: Hoare triple {27484#true} ~cond := #in~cond; {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:40,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,697 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 14:51:40,698 INFO L290 TraceCheckUtils]: 75: Hoare triple {27674#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {27723#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))))} is VALID [2022-04-15 14:51:40,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {27723#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))))} ~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; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,700 INFO L290 TraceCheckUtils]: 79: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,700 INFO L290 TraceCheckUtils]: 80: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,701 INFO L272 TraceCheckUtils]: 82: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27484#true} is VALID [2022-04-15 14:51:40,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,702 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27484#true} {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #86#return; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,702 INFO L272 TraceCheckUtils]: 87: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {27484#true} is VALID [2022-04-15 14:51:40,702 INFO L290 TraceCheckUtils]: 88: Hoare triple {27484#true} ~cond := #in~cond; {27484#true} is VALID [2022-04-15 14:51:40,702 INFO L290 TraceCheckUtils]: 89: Hoare triple {27484#true} assume !(0 == ~cond); {27484#true} is VALID [2022-04-15 14:51:40,702 INFO L290 TraceCheckUtils]: 90: Hoare triple {27484#true} assume true; {27484#true} is VALID [2022-04-15 14:51:40,703 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27484#true} {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #88#return; {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,703 INFO L272 TraceCheckUtils]: 92: Hoare triple {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {27484#true} is VALID [2022-04-15 14:51:40,703 INFO L290 TraceCheckUtils]: 93: Hoare triple {27484#true} ~cond := #in~cond; {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:40,703 INFO L290 TraceCheckUtils]: 94: Hoare triple {27663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,703 INFO L290 TraceCheckUtils]: 95: Hoare triple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:51:40,704 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27667#(not (= |__VERIFIER_assert_#in~cond| 0))} {27727#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #90#return; {27788#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 14:51:40,706 INFO L272 TraceCheckUtils]: 97: Hoare triple {27788#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {27792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:51:40,707 INFO L290 TraceCheckUtils]: 98: Hoare triple {27792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:51:40,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {27796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27485#false} is VALID [2022-04-15 14:51:40,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {27485#false} assume !false; {27485#false} is VALID [2022-04-15 14:51:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 84 proven. 53 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-15 14:51:40,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:52:26,150 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 14:53:05,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:53:05,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004324891] [2022-04-15 14:53:05,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:53:05,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940058106] [2022-04-15 14:53:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940058106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:53:05,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:53:05,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 14:53:05,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:53:05,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002408707] [2022-04-15 14:53:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002408707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:53:05,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:53:05,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 14:53:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269186668] [2022-04-15 14:53:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:53:05,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-15 14:53:05,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:53:05,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 14:53:05,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:05,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 14:53:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 14:53:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=367, Unknown=2, NotChecked=0, Total=462 [2022-04-15 14:53:05,444 INFO L87 Difference]: Start difference. First operand 327 states and 433 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 14:53:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:19,333 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-15 14:53:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 14:53:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-15 14:53:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:53:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 14:53:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-15 14:53:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 14:53:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-15 14:53:19,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-15 14:53:19,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:19,477 INFO L225 Difference]: With dead ends: 339 [2022-04-15 14:53:19,478 INFO L226 Difference]: Without dead ends: 337 [2022-04-15 14:53:19,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=122, Invalid=526, Unknown=2, NotChecked=0, Total=650 [2022-04-15 14:53:19,478 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 14:53:19,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 296 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 14:53:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-15 14:53:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-15 14:53:20,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:53:20,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:20,027 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:20,027 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:20,033 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-15 14:53:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-15 14:53:20,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:20,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:20,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-15 14:53:20,035 INFO L87 Difference]: Start difference. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-15 14:53:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:20,042 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-15 14:53:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-15 14:53:20,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:20,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:20,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:53:20,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:53:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-15 14:53:20,054 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-15 14:53:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:53:20,055 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-15 14:53:20,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 14:53:20,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-15 14:53:20,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-15 14:53:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 14:53:20,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:53:20,671 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 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, 1] [2022-04-15 14:53:20,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 14:53:20,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:53:20,884 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:53:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:53:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-15 14:53:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708975280] [2022-04-15 14:53:20,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:53:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-15 14:53:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:53:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392525363] [2022-04-15 14:53:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:53:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:53:20,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:53:20,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876279474] [2022-04-15 14:53:20,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 14:53:20,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:53:20,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:53:20,909 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:53:20,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 14:53:20,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 14:53:20,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:53:20,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:53:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:53:21,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:53:21,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {29919#true} call ULTIMATE.init(); {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {29919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29919#true} {29919#true} #98#return; {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {29919#true} call #t~ret8 := main(); {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {29919#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; {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {29919#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29919#true} {29919#true} #78#return; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {29919#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29919#true} {29919#true} #80#return; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {29919#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; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {29919#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29919#true} {29919#true} #82#return; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L272 TraceCheckUtils]: 22: Hoare triple {29919#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29919#true} {29919#true} #84#return; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {29919#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {29919#true} assume !!(#t~post6 < 5);havoc #t~post6; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {29919#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {29919#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {29919#true} assume !!(#t~post7 < 5);havoc #t~post7; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L272 TraceCheckUtils]: 32: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29919#true} {29919#true} #86#return; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L272 TraceCheckUtils]: 37: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29919#true} {29919#true} #88#return; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L272 TraceCheckUtils]: 42: Hoare triple {29919#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29919#true} {29919#true} #90#return; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L272 TraceCheckUtils]: 47: Hoare triple {29919#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)); {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29919#true} {29919#true} #92#return; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {29919#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {29919#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29919#true} is VALID [2022-04-15 14:53:21,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {29919#true} assume !!(#t~post7 < 5);havoc #t~post7; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L272 TraceCheckUtils]: 55: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29919#true} {29919#true} #86#return; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L272 TraceCheckUtils]: 60: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29919#true} {29919#true} #88#return; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L272 TraceCheckUtils]: 65: Hoare triple {29919#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,235 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29919#true} {29919#true} #90#return; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L272 TraceCheckUtils]: 70: Hoare triple {29919#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)); {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29919#true} {29919#true} #92#return; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {29919#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {29919#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {29919#true} assume !!(#t~post7 < 5);havoc #t~post7; {29919#true} is VALID [2022-04-15 14:53:21,236 INFO L272 TraceCheckUtils]: 78: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:21,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {29919#true} ~cond := #in~cond; {30161#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:53:21,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {30161#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:53:21,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:53:21,239 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} {29919#true} #86#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,239 INFO L272 TraceCheckUtils]: 83: Hoare triple {30172#(= 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)); {29919#true} is VALID [2022-04-15 14:53:21,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,239 INFO L290 TraceCheckUtils]: 85: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,240 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29919#true} {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,240 INFO L272 TraceCheckUtils]: 88: Hoare triple {30172#(= 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)); {29919#true} is VALID [2022-04-15 14:53:21,240 INFO L290 TraceCheckUtils]: 89: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,240 INFO L290 TraceCheckUtils]: 90: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,240 INFO L290 TraceCheckUtils]: 91: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,251 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29919#true} {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,251 INFO L272 TraceCheckUtils]: 93: Hoare triple {30172#(= 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)); {29919#true} is VALID [2022-04-15 14:53:21,252 INFO L290 TraceCheckUtils]: 94: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:21,252 INFO L290 TraceCheckUtils]: 95: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:21,252 INFO L290 TraceCheckUtils]: 96: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:21,252 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29919#true} {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {30172#(= 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; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:21,255 INFO L272 TraceCheckUtils]: 101: Hoare triple {30172#(= 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)); {30230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:53:21,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {30230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:53:21,256 INFO L290 TraceCheckUtils]: 103: Hoare triple {30234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29920#false} is VALID [2022-04-15 14:53:21,256 INFO L290 TraceCheckUtils]: 104: Hoare triple {29920#false} assume !false; {29920#false} is VALID [2022-04-15 14:53:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 14:53:21,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:53:25,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {29920#false} assume !false; {29920#false} is VALID [2022-04-15 14:53:25,333 INFO L290 TraceCheckUtils]: 103: Hoare triple {30234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29920#false} is VALID [2022-04-15 14:53:25,333 INFO L290 TraceCheckUtils]: 102: Hoare triple {30230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:53:25,334 INFO L272 TraceCheckUtils]: 101: Hoare triple {30172#(= 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)); {30230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:53:25,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,336 INFO L290 TraceCheckUtils]: 98: Hoare triple {30172#(= 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; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,337 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29919#true} {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,337 INFO L290 TraceCheckUtils]: 96: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,337 INFO L272 TraceCheckUtils]: 93: Hoare triple {30172#(= 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)); {29919#true} is VALID [2022-04-15 14:53:25,338 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29919#true} {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,338 INFO L272 TraceCheckUtils]: 88: Hoare triple {30172#(= 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)); {29919#true} is VALID [2022-04-15 14:53:25,339 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29919#true} {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,339 INFO L290 TraceCheckUtils]: 86: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,339 INFO L272 TraceCheckUtils]: 83: Hoare triple {30172#(= 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)); {29919#true} is VALID [2022-04-15 14:53:25,339 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} {29919#true} #86#return; {30172#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 14:53:25,340 INFO L290 TraceCheckUtils]: 81: Hoare triple {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:53:25,340 INFO L290 TraceCheckUtils]: 80: Hoare triple {30316#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:53:25,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {29919#true} ~cond := #in~cond; {30316#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:53:25,340 INFO L272 TraceCheckUtils]: 78: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,340 INFO L290 TraceCheckUtils]: 77: Hoare triple {29919#true} assume !!(#t~post7 < 5);havoc #t~post7; {29919#true} is VALID [2022-04-15 14:53:25,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {29919#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {29919#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29919#true} {29919#true} #92#return; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L272 TraceCheckUtils]: 70: Hoare triple {29919#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)); {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29919#true} {29919#true} #90#return; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 67: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 66: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L272 TraceCheckUtils]: 65: Hoare triple {29919#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29919#true} {29919#true} #88#return; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L272 TraceCheckUtils]: 60: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29919#true} {29919#true} #86#return; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L272 TraceCheckUtils]: 55: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {29919#true} assume !!(#t~post7 < 5);havoc #t~post7; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {29919#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {29919#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29919#true} {29919#true} #92#return; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,342 INFO L272 TraceCheckUtils]: 47: Hoare triple {29919#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)); {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29919#true} {29919#true} #90#return; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L272 TraceCheckUtils]: 42: Hoare triple {29919#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29919#true} {29919#true} #88#return; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L272 TraceCheckUtils]: 37: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29919#true} {29919#true} #86#return; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L272 TraceCheckUtils]: 32: Hoare triple {29919#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {29919#true} assume !!(#t~post7 < 5);havoc #t~post7; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {29919#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {29919#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {29919#true} assume !!(#t~post6 < 5);havoc #t~post6; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {29919#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29919#true} {29919#true} #84#return; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L272 TraceCheckUtils]: 22: Hoare triple {29919#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29919#true} {29919#true} #82#return; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {29919#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {29919#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; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29919#true} {29919#true} #80#return; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {29919#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29919#true} {29919#true} #78#return; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {29919#true} assume !(0 == ~cond); {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {29919#true} ~cond := #in~cond; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {29919#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {29919#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; {29919#true} is VALID [2022-04-15 14:53:25,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {29919#true} call #t~ret8 := main(); {29919#true} is VALID [2022-04-15 14:53:25,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29919#true} {29919#true} #98#return; {29919#true} is VALID [2022-04-15 14:53:25,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {29919#true} assume true; {29919#true} is VALID [2022-04-15 14:53:25,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {29919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29919#true} is VALID [2022-04-15 14:53:25,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {29919#true} call ULTIMATE.init(); {29919#true} is VALID [2022-04-15 14:53:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 14:53:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:53:25,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392525363] [2022-04-15 14:53:25,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:53:25,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876279474] [2022-04-15 14:53:25,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876279474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:53:25,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:53:25,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-15 14:53:25,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:53:25,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708975280] [2022-04-15 14:53:25,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708975280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:53:25,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:53:25,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:53:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834156079] [2022-04-15 14:53:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:53:25,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-15 14:53:25,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:53:25,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:53:25,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:25,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:53:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:53:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:53:25,390 INFO L87 Difference]: Start difference. First operand 335 states and 439 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:53:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:26,148 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-15 14:53:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:53:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-15 14:53:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:53:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:53:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 14:53:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:53:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 14:53:26,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-15 14:53:26,191 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 14:53:26,197 INFO L225 Difference]: With dead ends: 341 [2022-04-15 14:53:26,197 INFO L226 Difference]: Without dead ends: 339 [2022-04-15 14:53:26,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:53:26,198 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:53:26,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:53:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-15 14:53:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-15 14:53:26,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:53:26,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:26,757 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:26,757 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:26,763 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-15 14:53:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-15 14:53:26,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:26,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:26,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-15 14:53:26,764 INFO L87 Difference]: Start difference. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-15 14:53:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:26,770 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-15 14:53:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-15 14:53:26,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:26,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:26,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:53:26,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:53:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-15 14:53:26,778 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-15 14:53:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:53:26,778 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-15 14:53:26,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 14:53:26,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-15 14:53:27,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-15 14:53:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 14:53:27,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:53:27,399 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 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, 1] [2022-04-15 14:53:27,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 14:53:27,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:53:27,600 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:53:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:53:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-15 14:53:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499995172] [2022-04-15 14:53:27,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:53:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-15 14:53:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:53:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835705130] [2022-04-15 14:53:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:53:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:53:27,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:53:27,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072888350] [2022-04-15 14:53:27,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 14:53:27,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:53:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:53:27,612 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:53:27,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 14:53:27,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 14:53:27,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:53:27,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 14:53:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:53:27,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:53:28,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {32598#true} call ULTIMATE.init(); {32598#true} is VALID [2022-04-15 14:53:28,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {32598#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {32606#(<= ~counter~0 0)} assume true; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32606#(<= ~counter~0 0)} {32598#true} #98#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {32606#(<= ~counter~0 0)} call #t~ret8 := main(); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {32606#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {32606#(<= ~counter~0 0)} ~cond := #in~cond; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {32606#(<= ~counter~0 0)} assume !(0 == ~cond); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {32606#(<= ~counter~0 0)} assume true; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32606#(<= ~counter~0 0)} {32606#(<= ~counter~0 0)} #78#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {32606#(<= ~counter~0 0)} ~cond := #in~cond; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {32606#(<= ~counter~0 0)} assume !(0 == ~cond); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {32606#(<= ~counter~0 0)} assume true; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32606#(<= ~counter~0 0)} {32606#(<= ~counter~0 0)} #80#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {32606#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,049 INFO L272 TraceCheckUtils]: 17: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {32606#(<= ~counter~0 0)} ~cond := #in~cond; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {32606#(<= ~counter~0 0)} assume !(0 == ~cond); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {32606#(<= ~counter~0 0)} assume true; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,054 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32606#(<= ~counter~0 0)} {32606#(<= ~counter~0 0)} #82#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,055 INFO L272 TraceCheckUtils]: 22: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {32606#(<= ~counter~0 0)} ~cond := #in~cond; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {32606#(<= ~counter~0 0)} assume !(0 == ~cond); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {32606#(<= ~counter~0 0)} assume true; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,060 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32606#(<= ~counter~0 0)} {32606#(<= ~counter~0 0)} #84#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {32606#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32685#(<= ~counter~0 1)} is VALID [2022-04-15 14:53:28,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {32685#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {32685#(<= ~counter~0 1)} is VALID [2022-04-15 14:53:28,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {32685#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32685#(<= ~counter~0 1)} is VALID [2022-04-15 14:53:28,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {32685#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {32695#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,063 INFO L272 TraceCheckUtils]: 32: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {32695#(<= ~counter~0 2)} ~cond := #in~cond; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {32695#(<= ~counter~0 2)} assume !(0 == ~cond); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {32695#(<= ~counter~0 2)} assume true; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,065 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32695#(<= ~counter~0 2)} {32695#(<= ~counter~0 2)} #86#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,065 INFO L272 TraceCheckUtils]: 37: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {32695#(<= ~counter~0 2)} ~cond := #in~cond; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {32695#(<= ~counter~0 2)} assume !(0 == ~cond); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {32695#(<= ~counter~0 2)} assume true; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,067 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32695#(<= ~counter~0 2)} {32695#(<= ~counter~0 2)} #88#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,067 INFO L272 TraceCheckUtils]: 42: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {32695#(<= ~counter~0 2)} ~cond := #in~cond; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {32695#(<= ~counter~0 2)} assume !(0 == ~cond); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {32695#(<= ~counter~0 2)} assume true; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,069 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32695#(<= ~counter~0 2)} {32695#(<= ~counter~0 2)} #90#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,069 INFO L272 TraceCheckUtils]: 47: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {32695#(<= ~counter~0 2)} ~cond := #in~cond; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {32695#(<= ~counter~0 2)} assume !(0 == ~cond); {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {32695#(<= ~counter~0 2)} assume true; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,071 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32695#(<= ~counter~0 2)} {32695#(<= ~counter~0 2)} #92#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {32695#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {32695#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {32765#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,073 INFO L272 TraceCheckUtils]: 55: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {32765#(<= ~counter~0 3)} ~cond := #in~cond; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {32765#(<= ~counter~0 3)} assume !(0 == ~cond); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {32765#(<= ~counter~0 3)} assume true; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,074 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32765#(<= ~counter~0 3)} {32765#(<= ~counter~0 3)} #86#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,075 INFO L272 TraceCheckUtils]: 60: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {32765#(<= ~counter~0 3)} ~cond := #in~cond; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {32765#(<= ~counter~0 3)} assume !(0 == ~cond); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {32765#(<= ~counter~0 3)} assume true; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,076 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32765#(<= ~counter~0 3)} {32765#(<= ~counter~0 3)} #88#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,077 INFO L272 TraceCheckUtils]: 65: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {32765#(<= ~counter~0 3)} ~cond := #in~cond; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {32765#(<= ~counter~0 3)} assume !(0 == ~cond); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {32765#(<= ~counter~0 3)} assume true; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,078 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32765#(<= ~counter~0 3)} {32765#(<= ~counter~0 3)} #90#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,079 INFO L272 TraceCheckUtils]: 70: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,079 INFO L290 TraceCheckUtils]: 71: Hoare triple {32765#(<= ~counter~0 3)} ~cond := #in~cond; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {32765#(<= ~counter~0 3)} assume !(0 == ~cond); {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {32765#(<= ~counter~0 3)} assume true; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,080 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32765#(<= ~counter~0 3)} {32765#(<= ~counter~0 3)} #92#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {32765#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,081 INFO L290 TraceCheckUtils]: 76: Hoare triple {32765#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,081 INFO L290 TraceCheckUtils]: 77: Hoare triple {32835#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,082 INFO L272 TraceCheckUtils]: 78: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {32835#(<= ~counter~0 4)} ~cond := #in~cond; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {32835#(<= ~counter~0 4)} assume !(0 == ~cond); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,083 INFO L290 TraceCheckUtils]: 81: Hoare triple {32835#(<= ~counter~0 4)} assume true; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,083 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32835#(<= ~counter~0 4)} {32835#(<= ~counter~0 4)} #86#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,084 INFO L272 TraceCheckUtils]: 83: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,084 INFO L290 TraceCheckUtils]: 84: Hoare triple {32835#(<= ~counter~0 4)} ~cond := #in~cond; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,084 INFO L290 TraceCheckUtils]: 85: Hoare triple {32835#(<= ~counter~0 4)} assume !(0 == ~cond); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,085 INFO L290 TraceCheckUtils]: 86: Hoare triple {32835#(<= ~counter~0 4)} assume true; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,085 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32835#(<= ~counter~0 4)} {32835#(<= ~counter~0 4)} #88#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,086 INFO L272 TraceCheckUtils]: 88: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,086 INFO L290 TraceCheckUtils]: 89: Hoare triple {32835#(<= ~counter~0 4)} ~cond := #in~cond; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,086 INFO L290 TraceCheckUtils]: 90: Hoare triple {32835#(<= ~counter~0 4)} assume !(0 == ~cond); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,086 INFO L290 TraceCheckUtils]: 91: Hoare triple {32835#(<= ~counter~0 4)} assume true; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,087 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32835#(<= ~counter~0 4)} {32835#(<= ~counter~0 4)} #90#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,088 INFO L272 TraceCheckUtils]: 93: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {32835#(<= ~counter~0 4)} ~cond := #in~cond; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,088 INFO L290 TraceCheckUtils]: 95: Hoare triple {32835#(<= ~counter~0 4)} assume !(0 == ~cond); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {32835#(<= ~counter~0 4)} assume true; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,089 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32835#(<= ~counter~0 4)} {32835#(<= ~counter~0 4)} #92#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,089 INFO L290 TraceCheckUtils]: 98: Hoare triple {32835#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,089 INFO L290 TraceCheckUtils]: 99: Hoare triple {32835#(<= ~counter~0 4)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,090 INFO L290 TraceCheckUtils]: 100: Hoare triple {32835#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32908#(<= |main_#t~post6| 4)} is VALID [2022-04-15 14:53:28,090 INFO L290 TraceCheckUtils]: 101: Hoare triple {32908#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {32599#false} is VALID [2022-04-15 14:53:28,090 INFO L272 TraceCheckUtils]: 102: Hoare triple {32599#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32599#false} is VALID [2022-04-15 14:53:28,090 INFO L290 TraceCheckUtils]: 103: Hoare triple {32599#false} ~cond := #in~cond; {32599#false} is VALID [2022-04-15 14:53:28,090 INFO L290 TraceCheckUtils]: 104: Hoare triple {32599#false} assume 0 == ~cond; {32599#false} is VALID [2022-04-15 14:53:28,090 INFO L290 TraceCheckUtils]: 105: Hoare triple {32599#false} assume !false; {32599#false} is VALID [2022-04-15 14:53:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 215 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-15 14:53:28,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:53:28,425 INFO L290 TraceCheckUtils]: 105: Hoare triple {32599#false} assume !false; {32599#false} is VALID [2022-04-15 14:53:28,425 INFO L290 TraceCheckUtils]: 104: Hoare triple {32599#false} assume 0 == ~cond; {32599#false} is VALID [2022-04-15 14:53:28,425 INFO L290 TraceCheckUtils]: 103: Hoare triple {32599#false} ~cond := #in~cond; {32599#false} is VALID [2022-04-15 14:53:28,425 INFO L272 TraceCheckUtils]: 102: Hoare triple {32599#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32599#false} is VALID [2022-04-15 14:53:28,425 INFO L290 TraceCheckUtils]: 101: Hoare triple {32908#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {32599#false} is VALID [2022-04-15 14:53:28,426 INFO L290 TraceCheckUtils]: 100: Hoare triple {32835#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32908#(<= |main_#t~post6| 4)} is VALID [2022-04-15 14:53:28,426 INFO L290 TraceCheckUtils]: 99: Hoare triple {32835#(<= ~counter~0 4)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,426 INFO L290 TraceCheckUtils]: 98: Hoare triple {32835#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,427 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32598#true} {32835#(<= ~counter~0 4)} #92#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,427 INFO L290 TraceCheckUtils]: 96: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,427 INFO L290 TraceCheckUtils]: 95: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,427 INFO L290 TraceCheckUtils]: 94: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,427 INFO L272 TraceCheckUtils]: 93: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,428 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32598#true} {32835#(<= ~counter~0 4)} #90#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,428 INFO L290 TraceCheckUtils]: 91: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,428 INFO L272 TraceCheckUtils]: 88: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,428 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32598#true} {32835#(<= ~counter~0 4)} #88#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L290 TraceCheckUtils]: 84: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L272 TraceCheckUtils]: 83: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32598#true} {32835#(<= ~counter~0 4)} #86#return; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L290 TraceCheckUtils]: 80: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L290 TraceCheckUtils]: 79: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,429 INFO L272 TraceCheckUtils]: 78: Hoare triple {32835#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {32835#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {32765#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32835#(<= ~counter~0 4)} is VALID [2022-04-15 14:53:28,431 INFO L290 TraceCheckUtils]: 75: Hoare triple {32765#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,431 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32598#true} {32765#(<= ~counter~0 3)} #92#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L272 TraceCheckUtils]: 70: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32598#true} {32765#(<= ~counter~0 3)} #90#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L290 TraceCheckUtils]: 66: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,432 INFO L272 TraceCheckUtils]: 65: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,444 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32598#true} {32765#(<= ~counter~0 3)} #88#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,444 INFO L272 TraceCheckUtils]: 60: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,447 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32598#true} {32765#(<= ~counter~0 3)} #86#return; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,448 INFO L272 TraceCheckUtils]: 55: Hoare triple {32765#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {32765#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {32695#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32765#(<= ~counter~0 3)} is VALID [2022-04-15 14:53:28,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {32695#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,450 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32598#true} {32695#(<= ~counter~0 2)} #92#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,450 INFO L272 TraceCheckUtils]: 47: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,450 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32598#true} {32695#(<= ~counter~0 2)} #90#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,451 INFO L272 TraceCheckUtils]: 42: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,451 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32598#true} {32695#(<= ~counter~0 2)} #88#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,451 INFO L272 TraceCheckUtils]: 37: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,452 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32598#true} {32695#(<= ~counter~0 2)} #86#return; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,452 INFO L272 TraceCheckUtils]: 32: Hoare triple {32695#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {32695#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {32685#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32695#(<= ~counter~0 2)} is VALID [2022-04-15 14:53:28,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {32685#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32685#(<= ~counter~0 1)} is VALID [2022-04-15 14:53:28,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {32685#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {32685#(<= ~counter~0 1)} is VALID [2022-04-15 14:53:28,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {32606#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32685#(<= ~counter~0 1)} is VALID [2022-04-15 14:53:28,454 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32598#true} {32606#(<= ~counter~0 0)} #84#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L272 TraceCheckUtils]: 22: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32598#true} {32606#(<= ~counter~0 0)} #82#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,455 INFO L272 TraceCheckUtils]: 17: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {32606#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,456 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32598#true} {32606#(<= ~counter~0 0)} #80#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32598#true} {32606#(<= ~counter~0 0)} #78#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {32598#true} assume true; {32598#true} is VALID [2022-04-15 14:53:28,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {32598#true} assume !(0 == ~cond); {32598#true} is VALID [2022-04-15 14:53:28,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {32598#true} ~cond := #in~cond; {32598#true} is VALID [2022-04-15 14:53:28,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {32606#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32598#true} is VALID [2022-04-15 14:53:28,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {32606#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {32606#(<= ~counter~0 0)} call #t~ret8 := main(); {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32606#(<= ~counter~0 0)} {32598#true} #98#return; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {32606#(<= ~counter~0 0)} assume true; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {32598#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32606#(<= ~counter~0 0)} is VALID [2022-04-15 14:53:28,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {32598#true} call ULTIMATE.init(); {32598#true} is VALID [2022-04-15 14:53:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-15 14:53:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:53:28,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835705130] [2022-04-15 14:53:28,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:53:28,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072888350] [2022-04-15 14:53:28,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072888350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:53:28,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:53:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 14:53:28,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:53:28,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499995172] [2022-04-15 14:53:28,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499995172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:53:28,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:53:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:53:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719317287] [2022-04-15 14:53:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:53:28,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-15 14:53:28,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:53:28,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 14:53:28,518 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 14:53:28,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:53:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:53:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:53:28,519 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 14:53:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:29,340 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-15 14:53:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 14:53:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-15 14:53:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:53:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 14:53:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 14:53:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 14:53:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 14:53:29,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-15 14:53:29,422 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 14:53:29,429 INFO L225 Difference]: With dead ends: 349 [2022-04-15 14:53:29,429 INFO L226 Difference]: Without dead ends: 342 [2022-04-15 14:53:29,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:53:29,429 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:53:29,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 183 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:53:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-15 14:53:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-15 14:53:29,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:53:29,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:29,977 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:29,978 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:29,983 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-15 14:53:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-15 14:53:29,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:29,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:29,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-15 14:53:29,985 INFO L87 Difference]: Start difference. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-15 14:53:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:29,990 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-15 14:53:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-15 14:53:29,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:29,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:29,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:53:29,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:53:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-15 14:53:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-15 14:53:30,002 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-15 14:53:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:53:30,003 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-15 14:53:30,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 14:53:30,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-15 14:53:30,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-15 14:53:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 14:53:30,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:53:30,641 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, 1, 1] [2022-04-15 14:53:30,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 14:53:30,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 14:53:30,842 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:53:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:53:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-15 14:53:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210588827] [2022-04-15 14:53:30,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:53:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-15 14:53:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:53:30,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115534042] [2022-04-15 14:53:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:53:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:53:30,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:53:30,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871457130] [2022-04-15 14:53:30,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 14:53:30,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:53:30,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:53:30,859 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:53:30,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 14:53:30,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 14:53:30,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:53:30,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 14:53:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:53:30,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:53:31,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {35313#true} call ULTIMATE.init(); {35313#true} is VALID [2022-04-15 14:53:31,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {35313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35313#true} {35313#true} #98#return; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {35313#true} call #t~ret8 := main(); {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {35313#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; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {35313#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35313#true} {35313#true} #78#return; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {35313#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35313#true} {35313#true} #80#return; {35313#true} is VALID [2022-04-15 14:53:31,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {35313#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; {35366#(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 14:53:31,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {35366#(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)); {35313#true} is VALID [2022-04-15 14:53:31,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,878 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35313#true} {35366#(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; {35366#(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 14:53:31,878 INFO L272 TraceCheckUtils]: 22: Hoare triple {35366#(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)); {35313#true} is VALID [2022-04-15 14:53:31,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,879 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35313#true} {35366#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {35366#(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 14:53:31,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {35366#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35366#(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 14:53:31,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {35366#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {35366#(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 14:53:31,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {35366#(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; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,881 INFO L272 TraceCheckUtils]: 32: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35313#true} is VALID [2022-04-15 14:53:31,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,881 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35313#true} {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,881 INFO L272 TraceCheckUtils]: 37: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35313#true} is VALID [2022-04-15 14:53:31,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,882 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35313#true} {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,882 INFO L272 TraceCheckUtils]: 42: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35313#true} is VALID [2022-04-15 14:53:31,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,883 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35313#true} {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,883 INFO L272 TraceCheckUtils]: 47: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35313#true} is VALID [2022-04-15 14:53:31,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,884 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35313#true} {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 14:53:31,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {35406#(and (= main_~r~0 0) (= main_~c~0 main_~a~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; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,886 INFO L272 TraceCheckUtils]: 55: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {35313#true} is VALID [2022-04-15 14:53:31,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,888 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35313#true} {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,888 INFO L272 TraceCheckUtils]: 60: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {35313#true} is VALID [2022-04-15 14:53:31,888 INFO L290 TraceCheckUtils]: 61: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,888 INFO L290 TraceCheckUtils]: 62: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,888 INFO L290 TraceCheckUtils]: 63: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,889 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35313#true} {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,889 INFO L272 TraceCheckUtils]: 65: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {35313#true} is VALID [2022-04-15 14:53:31,889 INFO L290 TraceCheckUtils]: 66: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,889 INFO L290 TraceCheckUtils]: 67: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,889 INFO L290 TraceCheckUtils]: 68: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,889 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35313#true} {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,890 INFO L272 TraceCheckUtils]: 70: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {35313#true} is VALID [2022-04-15 14:53:31,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,890 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35313#true} {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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 14:53:31,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {35476#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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; {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,892 INFO L272 TraceCheckUtils]: 78: Hoare triple {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~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)); {35313#true} is VALID [2022-04-15 14:53:31,893 INFO L290 TraceCheckUtils]: 79: Hoare triple {35313#true} ~cond := #in~cond; {35559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:53:31,893 INFO L290 TraceCheckUtils]: 80: Hoare triple {35559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:53:31,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {35563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:53:31,894 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35563#(not (= |__VERIFIER_assert_#in~cond| 0))} {35546#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,894 INFO L272 TraceCheckUtils]: 83: Hoare triple {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35313#true} is VALID [2022-04-15 14:53:31,894 INFO L290 TraceCheckUtils]: 84: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,894 INFO L290 TraceCheckUtils]: 85: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,895 INFO L290 TraceCheckUtils]: 86: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,895 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35313#true} {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #88#return; {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,895 INFO L272 TraceCheckUtils]: 88: Hoare triple {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35313#true} is VALID [2022-04-15 14:53:31,895 INFO L290 TraceCheckUtils]: 89: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,895 INFO L290 TraceCheckUtils]: 90: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,895 INFO L290 TraceCheckUtils]: 91: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,896 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {35313#true} {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #90#return; {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,896 INFO L272 TraceCheckUtils]: 93: Hoare triple {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~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)); {35313#true} is VALID [2022-04-15 14:53:31,896 INFO L290 TraceCheckUtils]: 94: Hoare triple {35313#true} ~cond := #in~cond; {35313#true} is VALID [2022-04-15 14:53:31,896 INFO L290 TraceCheckUtils]: 95: Hoare triple {35313#true} assume !(0 == ~cond); {35313#true} is VALID [2022-04-15 14:53:31,896 INFO L290 TraceCheckUtils]: 96: Hoare triple {35313#true} assume true; {35313#true} is VALID [2022-04-15 14:53:31,897 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {35313#true} {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #92#return; {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,897 INFO L290 TraceCheckUtils]: 98: Hoare triple {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-15 14:53:31,899 INFO L290 TraceCheckUtils]: 99: Hoare triple {35570#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35622#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-15 14:53:31,899 INFO L290 TraceCheckUtils]: 100: Hoare triple {35622#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35622#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-15 14:53:31,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {35622#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {35622#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-15 14:53:31,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {35622#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !(0 != ~b~0); {35632#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} is VALID [2022-04-15 14:53:31,901 INFO L272 TraceCheckUtils]: 103: Hoare triple {35632#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {35636#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:53:31,901 INFO L290 TraceCheckUtils]: 104: Hoare triple {35636#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35640#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:53:31,901 INFO L290 TraceCheckUtils]: 105: Hoare triple {35640#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35314#false} is VALID [2022-04-15 14:53:31,902 INFO L290 TraceCheckUtils]: 106: Hoare triple {35314#false} assume !false; {35314#false} is VALID [2022-04-15 14:53:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 47 proven. 34 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-04-15 14:53:31,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:53:41,800 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 14:53:41,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:53:41,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115534042] [2022-04-15 14:53:41,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:53:41,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871457130] [2022-04-15 14:53:41,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871457130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:53:41,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:53:41,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 14:53:41,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:53:41,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210588827] [2022-04-15 14:53:41,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210588827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:53:41,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:53:41,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 14:53:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384008449] [2022-04-15 14:53:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:53:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-15 14:53:41,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:53:41,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 14:53:41,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:41,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 14:53:41,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 14:53:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-15 14:53:41,985 INFO L87 Difference]: Start difference. First operand 342 states and 445 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 14:53:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:44,669 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-15 14:53:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 14:53:44,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-15 14:53:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:53:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 14:53:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-15 14:53:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 14:53:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-15 14:53:44,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-15 14:53:44,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:44,823 INFO L225 Difference]: With dead ends: 369 [2022-04-15 14:53:44,823 INFO L226 Difference]: Without dead ends: 366 [2022-04-15 14:53:44,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-15 14:53:44,823 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 14:53:44,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 296 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 14:53:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-15 14:53:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-15 14:53:45,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:53:45,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-15 14:53:45,432 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-15 14:53:45,432 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-15 14:53:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:45,442 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-15 14:53:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-15 14:53:45,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:45,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:45,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-15 14:53:45,444 INFO L87 Difference]: Start difference. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-15 14:53:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:53:45,453 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-15 14:53:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-15 14:53:45,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:53:45,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:53:45,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:53:45,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:53:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-15 14:53:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-15 14:53:45,466 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-15 14:53:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:53:45,466 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-15 14:53:45,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 14:53:45,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-15 14:53:46,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:53:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-15 14:53:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 14:53:46,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:53:46,186 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:53:46,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 14:53:46,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 14:53:46,386 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:53:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:53:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-15 14:53:46,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:53:46,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802498312] [2022-04-15 14:53:46,387 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:53:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-15 14:53:46,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:53:46,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842285942] [2022-04-15 14:53:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:53:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:53:46,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:53:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826482374] [2022-04-15 14:53:46,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 14:53:46,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:53:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:53:46,398 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:53:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 14:53:46,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 14:53:46,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 14:53:46,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 14:53:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 14:53:46,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 14:53:46,603 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 14:53:46,603 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 14:53:46,608 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 14:53:46,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 14:53:46,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 14:53:46,830 INFO L719 BasicCegarLoop]: Path program histogram: [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 14:53:46,832 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 14:53:46,844 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 14:53:46,845 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 14:53:46,846 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 14:53:46,847 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 14:53:46,847 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 14:53:46,847 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 14:53:46,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:53:46 BoogieIcfgContainer [2022-04-15 14:53:46,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 14:53:46,848 INFO L158 Benchmark]: Toolchain (without parser) took 361539.92ms. Allocated memory was 184.5MB in the beginning and 292.6MB in the end (delta: 108.0MB). Free memory was 129.0MB in the beginning and 200.7MB in the end (delta: -71.7MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2022-04-15 14:53:46,848 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 14:53:46,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.26ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 128.7MB in the beginning and 214.3MB in the end (delta: -85.6MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-15 14:53:46,848 INFO L158 Benchmark]: Boogie Preprocessor took 22.15ms. Allocated memory is still 243.3MB. Free memory was 214.3MB in the beginning and 212.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 14:53:46,848 INFO L158 Benchmark]: RCFGBuilder took 308.12ms. Allocated memory is still 243.3MB. Free memory was 212.7MB in the beginning and 198.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 14:53:46,849 INFO L158 Benchmark]: TraceAbstraction took 360956.99ms. Allocated memory was 243.3MB in the beginning and 292.6MB in the end (delta: 49.3MB). Free memory was 198.1MB in the beginning and 200.7MB in the end (delta: -2.6MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2022-04-15 14:53:46,849 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.26ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 128.7MB in the beginning and 214.3MB in the end (delta: -85.6MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.15ms. Allocated memory is still 243.3MB. Free memory was 214.3MB in the beginning and 212.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 308.12ms. Allocated memory is still 243.3MB. Free memory was 212.7MB in the beginning and 198.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 360956.99ms. Allocated memory was 243.3MB in the beginning and 292.6MB in the end (delta: 49.3MB). Free memory was 198.1MB in the beginning and 200.7MB in the end (delta: -2.6MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) [L8] COND FALSE !(!cond) [L24] RET assume_abort_if_not(x >= 1) [L25] CALL assume_abort_if_not(y >= 1) [L8] COND FALSE !(!cond) [L25] RET assume_abort_if_not(y >= 1) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y [L37] CALL assume_abort_if_not(xy < 2147483647) [L8] COND FALSE !(!cond) [L37] RET assume_abort_if_not(xy < 2147483647) [L38] CALL assume_abort_if_not(yy < 2147483647) [L8] COND FALSE !(!cond) [L38] RET assume_abort_if_not(yy < 2147483647) [L40] EXPR counter++ [L40] COND TRUE counter++<5 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(a == k * b + c) [L48] CALL __VERIFIER_assert(a == y*r + x*p) [L11] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(a == y*r + x*p) [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(b == x * q + y * s) [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND TRUE counter++<5 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(a == k * b + c) [L48] CALL __VERIFIER_assert(a == y*r + x*p) [L11] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(a == y*r + x*p) [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(b == x * q + y * s) [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 [L46] EXPR counter++ [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(a == k * b + c) [L48] CALL __VERIFIER_assert(a == y*r + x*p) [L11] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(a == y*r + x*p) [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(b == x * q + y * s) [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND FALSE !(counter++<5) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) [L11] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 360.9s, OverallIterations: 27, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 39.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 4887 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 62 IncrementalHoareTripleChecker+Unchecked, 3639 mSDsCounter, 474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3903 IncrementalHoareTripleChecker+Invalid, 4439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 474 mSolverCounterUnsat, 1248 mSDtfsCounter, 3903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3065 GetRequests, 2776 SyntacticMatches, 26 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=26, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 120 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 14:53:46,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...