/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-34549b5 [2022-04-08 12:15:17,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:15:17,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:15:17,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:15:17,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:15:17,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:15:17,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:15:17,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:15:17,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:15:17,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:15:17,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:15:17,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:15:17,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:15:17,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:15:17,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:15:17,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:15:17,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:15:17,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:15:17,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:15:17,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:15:17,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:15:17,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:15:17,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:15:17,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:15:17,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:15:17,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:15:17,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:15:17,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:15:17,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:15:17,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:15:17,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:15:17,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:15:17,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:15:17,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:15:17,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:15:17,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:15:17,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:15:17,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:15:17,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:15:17,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:15:17,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:15:17,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:15:17,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:15:17,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:15:17,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:15:17,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:15:17,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:15:17,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:15:17,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:15:17,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:15:17,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:15:17,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:15:17,426 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:15:17,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:15:17,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:15:17,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:15:17,427 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:15:17,427 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-08 12:15:17,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:15:17,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:15:17,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:15:17,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:15:17,663 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:15:17,664 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-08 12:15:17,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0a69fb1/2362f87845f942c7a5bca4f3a7405adc/FLAG3520e18c3 [2022-04-08 12:15:18,072 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:15:18,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-08 12:15:18,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0a69fb1/2362f87845f942c7a5bca4f3a7405adc/FLAG3520e18c3 [2022-04-08 12:15:18,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0a69fb1/2362f87845f942c7a5bca4f3a7405adc [2022-04-08 12:15:18,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:15:18,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:15:18,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:15:18,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:15:18,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:15:18,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f783e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18, skipping insertion in model container [2022-04-08 12:15:18,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:15:18,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:15:18,233 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-08 12:15:18,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:15:18,280 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:15:18,288 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-08 12:15:18,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:15:18,304 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:15:18,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18 WrapperNode [2022-04-08 12:15:18,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:15:18,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:15:18,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:15:18,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:15:18,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:15:18,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:15:18,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:15:18,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:15:18,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (1/1) ... [2022-04-08 12:15:18,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:15:18,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:18,370 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-08 12:15:18,371 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-08 12:15:18,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:15:18,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:15:18,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:15:18,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:15:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:15:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:15:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:15:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:15:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:15:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:15:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:15:18,462 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:15:18,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:15:18,661 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:15:18,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:15:18,667 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 12:15:18,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:15:18 BoogieIcfgContainer [2022-04-08 12:15:18,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:15:18,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:15:18,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:15:18,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:15:18,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:15:18" (1/3) ... [2022-04-08 12:15:18,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c335423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:15:18, skipping insertion in model container [2022-04-08 12:15:18,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:15:18" (2/3) ... [2022-04-08 12:15:18,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c335423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:15:18, skipping insertion in model container [2022-04-08 12:15:18,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:15:18" (3/3) ... [2022-04-08 12:15:18,675 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound5.c [2022-04-08 12:15:18,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:15:18,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:15:18,742 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:15:18,747 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-08 12:15:18,747 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:15:18,767 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-08 12:15:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 12:15:18,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:18,774 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-08 12:15:18,776 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-08 12:15:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548750159] [2022-04-08 12:15:18,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-08 12:15:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:18,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678442191] [2022-04-08 12:15:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:15:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:19,000 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-08 12:15:19,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 12:15:19,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-08 12:15:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 12:15:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:19,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-08 12:15:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 12:15:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:19,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-08 12:15:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 12:15:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:19,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-08 12:15:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 12:15:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:19,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-08 12:15:19,069 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-08 12:15:19,069 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-08 12:15:19,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 12:15:19,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-08 12:15:19,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-08 12:15:19,070 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-08 12:15:19,071 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-08 12:15:19,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-08 12:15:19,072 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-08 12:15:19,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-08 12:15:19,074 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-08 12:15:19,074 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-08 12:15:19,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,076 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-08 12:15:19,077 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-08 12:15:19,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 12:15:19,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 12:15:19,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 12:15:19,079 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-08 12:15:19,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-08 12:15:19,082 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-08 12:15:19,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-08 12:15:19,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-08 12:15:19,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 12:15:19,084 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-08 12:15:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:19,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678442191] [2022-04-08 12:15:19,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678442191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:19,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:19,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:15:19,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548750159] [2022-04-08 12:15:19,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548750159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:19,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:19,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:15:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133023672] [2022-04-08 12:15:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:19,098 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-08 12:15:19,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:19,103 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-08 12:15:19,143 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-08 12:15:19,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 12:15:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:19,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 12:15:19,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:15:19,181 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-08 12:15:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:19,434 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-08 12:15:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 12:15:19,435 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-08 12:15:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:19,436 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-08 12:15:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-08 12:15:19,444 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-08 12:15:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-08 12:15:19,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-08 12:15:19,575 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-08 12:15:19,583 INFO L225 Difference]: With dead ends: 72 [2022-04-08 12:15:19,583 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 12:15:19,590 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-08 12:15:19,593 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-08 12:15:19,594 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-08 12:15:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 12:15:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 12:15:19,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:19,622 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-08 12:15:19,623 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-08 12:15:19,624 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-08 12:15:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:19,635 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 12:15:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 12:15:19,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:19,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:19,636 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-08 12:15:19,637 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-08 12:15:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:19,641 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 12:15:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 12:15:19,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:19,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:19,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:19,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:19,654 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-08 12:15:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 12:15:19,657 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-08 12:15:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:19,657 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-08 12:15:19,657 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-08 12:15:19,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 12:15:19,739 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-08 12:15:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 12:15:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 12:15:19,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:19,741 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-08 12:15:19,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 12:15:19,741 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-08 12:15:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:19,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089606946] [2022-04-08 12:15:19,742 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-08 12:15:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:19,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859689165] [2022-04-08 12:15:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:19,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:19,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651122091] [2022-04-08 12:15:19,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:19,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:19,758 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-08 12:15:19,758 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-08 12:15:19,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:15:19,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:15:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:19,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:20,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-08 12:15:20,051 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-08 12:15:20,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,053 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-08 12:15:20,053 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-08 12:15:20,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,055 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-08 12:15:20,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,057 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,057 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-08 12:15:20,057 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-08 12:15:20,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,059 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,059 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-08 12:15:20,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,061 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:20,061 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-08 12:15:20,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {349#false} is VALID [2022-04-08 12:15:20,062 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-08 12:15:20,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-08 12:15:20,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-08 12:15:20,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-08 12:15:20,063 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-08 12:15:20,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:15:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:20,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859689165] [2022-04-08 12:15:20,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:15:20,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651122091] [2022-04-08 12:15:20,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651122091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:20,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:20,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:15:20,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:20,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089606946] [2022-04-08 12:15:20,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089606946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:20,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:20,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:15:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706646021] [2022-04-08 12:15:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:20,065 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-08 12:15:20,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:20,065 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-08 12:15:20,083 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-08 12:15:20,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:15:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:15:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:15:20,084 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-08 12:15:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:20,156 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-08 12:15:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:15:20,156 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-08 12:15:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:20,156 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-08 12:15:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 12:15:20,158 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-08 12:15:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 12:15:20,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-08 12:15:20,197 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-08 12:15:20,198 INFO L225 Difference]: With dead ends: 44 [2022-04-08 12:15:20,198 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 12:15:20,199 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-08 12:15:20,199 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-08 12:15:20,200 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-08 12:15:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 12:15:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 12:15:20,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:20,211 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-08 12:15:20,211 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-08 12:15:20,211 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-08 12:15:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:20,213 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 12:15:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 12:15:20,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:20,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:20,214 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-08 12:15:20,214 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-08 12:15:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:20,216 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 12:15:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 12:15:20,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:20,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:20,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:20,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:20,217 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-08 12:15:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-08 12:15:20,219 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-08 12:15:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:20,219 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-08 12:15:20,219 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-08 12:15:20,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-08 12:15:20,279 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-08 12:15:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 12:15:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 12:15:20,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:20,281 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-08 12:15:20,327 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-08 12:15:20,499 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-08 12:15:20,500 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-08 12:15:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:20,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1615318403] [2022-04-08 12:15:20,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-08 12:15:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:20,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546359270] [2022-04-08 12:15:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:20,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:20,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138663909] [2022-04-08 12:15:20,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:20,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:20,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:20,532 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-08 12:15:20,572 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-08 12:15:20,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:15:20,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:20,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:15:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:20,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:20,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-08 12:15:20,754 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-08 12:15:20,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-08 12:15:20,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-08 12:15:20,754 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-08 12:15:20,754 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-08 12:15:20,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 12:15:20,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 12:15:20,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-08 12:15:20,755 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-08 12:15:20,755 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-08 12:15:20,756 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-08 12:15:20,756 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-08 12:15:20,756 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-08 12:15:20,757 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-08 12:15:20,757 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-08 12:15:20,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 12:15:20,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 12:15:20,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 12:15:20,765 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-08 12:15:20,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 12:15:20,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 12:15:20,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,766 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 12:15:20,766 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-08 12:15:20,767 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-08 12:15:20,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-08 12:15:20,770 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-08 12:15:20,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-08 12:15:20,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-08 12:15:20,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-08 12:15:20,771 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-08 12:15:20,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:15:20,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-08 12:15:20,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-08 12:15:20,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-08 12:15:20,974 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-08 12:15:20,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-08 12:15:20,975 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-08 12:15:20,975 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-08 12:15:20,975 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 12:15:20,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 12:15:20,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 12:15:20,976 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-08 12:15:20,976 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 12:15:20,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 12:15:20,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 12:15:20,977 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-08 12:15:20,978 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-08 12:15:20,981 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-08 12:15:20,982 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-08 12:15:20,982 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-08 12:15:20,983 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-08 12:15:20,983 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-08 12:15:20,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-08 12:15:20,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 12:15:20,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 12:15:20,983 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-08 12:15:20,984 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-08 12:15:20,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-08 12:15:20,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-08 12:15:20,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 12:15:20,984 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-08 12:15:20,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-08 12:15:20,985 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-08 12:15:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:20,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546359270] [2022-04-08 12:15:20,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:15:20,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138663909] [2022-04-08 12:15:20,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138663909] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:15:20,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:15:20,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-08 12:15:20,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1615318403] [2022-04-08 12:15:20,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1615318403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:20,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:20,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:15:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337158940] [2022-04-08 12:15:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:20,987 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-08 12:15:20,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:20,987 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-08 12:15:21,006 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-08 12:15:21,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:15:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:15:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 12:15:21,007 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-08 12:15:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:21,312 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-08 12:15:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:15:21,312 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-08 12:15:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:21,312 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-08 12:15:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 12:15:21,314 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-08 12:15:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 12:15:21,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-08 12:15:21,390 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-08 12:15:21,391 INFO L225 Difference]: With dead ends: 53 [2022-04-08 12:15:21,391 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 12:15:21,392 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-08 12:15:21,392 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-08 12:15:21,393 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-08 12:15:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 12:15:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-08 12:15:21,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:21,439 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-08 12:15:21,439 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-08 12:15:21,440 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-08 12:15:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:21,442 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-08 12:15:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 12:15:21,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:21,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:21,443 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-08 12:15:21,443 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-08 12:15:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:21,446 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-08 12:15:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 12:15:21,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:21,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:21,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:21,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:21,447 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-08 12:15:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-08 12:15:21,448 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-08 12:15:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:21,449 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-08 12:15:21,449 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-08 12:15:21,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-08 12:15:21,491 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-08 12:15:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-08 12:15:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 12:15:21,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:21,492 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-08 12:15:21,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 12:15:21,704 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-08 12:15:21,705 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-08 12:15:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:21,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770980881] [2022-04-08 12:15:21,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-08 12:15:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:21,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287863767] [2022-04-08 12:15:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:21,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86264356] [2022-04-08 12:15:21,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:21,744 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-08 12:15:21,747 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-08 12:15:21,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:15:21,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:21,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 12:15:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:21,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-08 12:15:21,902 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-08 12:15:21,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 12:15:21,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-08 12:15:21,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-08 12:15:21,902 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-08 12:15:21,902 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-08 12:15:21,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 12:15:21,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 12:15:21,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 12:15:21,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-08 12:15:21,903 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-08 12:15:21,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 12:15:21,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 12:15:21,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 12:15:21,903 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-08 12:15:21,903 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-08 12:15:21,903 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-08 12:15:21,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 12:15:21,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 12:15:21,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 12:15:21,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-08 12:15:21,904 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-08 12:15:21,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 12:15:21,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 12:15:21,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 12:15:21,904 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-08 12:15:21,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-08 12:15:21,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 5);havoc #t~post6; {1166#true} is VALID [2022-04-08 12:15:21,906 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-08 12:15:21,906 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-08 12:15:21,907 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-08 12:15:21,908 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-08 12:15:21,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:21,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-08 12:15:21,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-08 12:15:21,908 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-08 12:15:21,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:15:21,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:21,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287863767] [2022-04-08 12:15:21,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:15:21,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86264356] [2022-04-08 12:15:21,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86264356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:21,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:21,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:15:21,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:21,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770980881] [2022-04-08 12:15:21,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770980881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:21,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:21,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:15:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634206415] [2022-04-08 12:15:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:21,910 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-08 12:15:21,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:21,910 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-08 12:15:21,926 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-08 12:15:21,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:15:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:15:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:15:21,927 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-08 12:15:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:22,098 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-08 12:15:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:15:22,099 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-08 12:15:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:22,099 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-08 12:15:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 12:15:22,100 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-08 12:15:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 12:15:22,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 12:15:22,144 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-08 12:15:22,145 INFO L225 Difference]: With dead ends: 51 [2022-04-08 12:15:22,145 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 12:15:22,146 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-08 12:15:22,146 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-08 12:15:22,147 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-08 12:15:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 12:15:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-08 12:15:22,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:22,190 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-08 12:15:22,190 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-08 12:15:22,190 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-08 12:15:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:22,192 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 12:15:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 12:15:22,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:22,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:22,193 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-08 12:15:22,193 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-08 12:15:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:22,194 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 12:15:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 12:15:22,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:22,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:22,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:22,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:22,195 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-08 12:15:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-08 12:15:22,197 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-08 12:15:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:22,197 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-08 12:15:22,197 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-08 12:15:22,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-08 12:15:22,242 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-08 12:15:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-08 12:15:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 12:15:22,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:22,243 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-08 12:15:22,261 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-08 12:15:22,443 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-08 12:15:22,444 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-08 12:15:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:22,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1561238829] [2022-04-08 12:15:22,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-08 12:15:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551276524] [2022-04-08 12:15:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:22,460 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:22,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400802401] [2022-04-08 12:15:22,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:22,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:22,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:22,465 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-08 12:15:22,470 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-08 12:15:22,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:15:22,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:22,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:15:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:22,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:22,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-08 12:15:22,661 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-08 12:15:22,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,663 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-08 12:15:22,663 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-08 12:15:22,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #78#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,668 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-08 12:15:22,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,669 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #80#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,669 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-08 12:15:22,670 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-08 12:15:22,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,671 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #82#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,671 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-08 12:15:22,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,672 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #84#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 12:15:22,673 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-08 12:15:22,673 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-08 12:15:22,673 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-08 12:15:22,674 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-08 12:15:22,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {1665#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1569#false} is VALID [2022-04-08 12:15:22,674 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-08 12:15:22,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-08 12:15:22,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 5);havoc #t~post6; {1569#false} is VALID [2022-04-08 12:15:22,674 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-08 12:15:22,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-08 12:15:22,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-08 12:15:22,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-08 12:15:22,675 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-08 12:15:22,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:15:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551276524] [2022-04-08 12:15:22,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:15:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400802401] [2022-04-08 12:15:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400802401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:15:22,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:22,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1561238829] [2022-04-08 12:15:22,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1561238829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:22,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:22,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:15:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305491566] [2022-04-08 12:15:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:22,676 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-08 12:15:22,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:22,676 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-08 12:15:22,695 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-08 12:15:22,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:15:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:15:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:15:22,696 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-08 12:15:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:22,861 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-08 12:15:22,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:15:22,862 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-08 12:15:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:22,862 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-08 12:15:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 12:15:22,863 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-08 12:15:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 12:15:22,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-08 12:15:22,914 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-08 12:15:22,915 INFO L225 Difference]: With dead ends: 72 [2022-04-08 12:15:22,915 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 12:15:22,915 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-08 12:15:22,916 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-08 12:15:22,916 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-08 12:15:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 12:15:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 12:15:22,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:22,958 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-08 12:15:22,959 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-08 12:15:22,959 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-08 12:15:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:22,960 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 12:15:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 12:15:22,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:22,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:22,961 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-08 12:15:22,961 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-08 12:15:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:22,962 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 12:15:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 12:15:22,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:22,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:22,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:22,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:22,963 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-08 12:15:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-08 12:15:22,964 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-08 12:15:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:22,965 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-08 12:15:22,965 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-08 12:15:22,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-08 12:15:23,016 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-08 12:15:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 12:15:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 12:15:23,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:23,017 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-08 12:15:23,037 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-08 12:15:23,227 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-08 12:15:23,227 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-08 12:15:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950077194] [2022-04-08 12:15:23,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-08 12:15:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307054710] [2022-04-08 12:15:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:23,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:23,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148159324] [2022-04-08 12:15:23,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:23,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:23,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:23,245 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-08 12:15:23,247 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-08 12:15:23,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:15:23,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:23,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 12:15:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:23,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:23,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-08 12:15:23,566 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-08 12:15:23,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-08 12:15:23,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-08 12:15:23,566 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-08 12:15:23,566 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-08 12:15:23,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-08 12:15:23,567 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-08 12:15:23,567 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-08 12:15:23,567 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-08 12:15:23,581 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-08 12:15:23,582 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-08 12:15:23,586 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-08 12:15:23,586 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-08 12:15:23,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,588 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-08 12:15:23,588 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-08 12:15:23,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,589 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-08 12:15:23,590 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-08 12:15:23,590 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-08 12:15:23,591 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-08 12:15:23,603 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-08 12:15:23,604 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-08 12:15:23,604 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-08 12:15:23,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,605 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-08 12:15:23,605 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-08 12:15:23,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:23,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-08 12:15:23,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-08 12:15:23,606 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-08 12:15:23,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:15:23,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-08 12:15:23,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-08 12:15:23,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:23,809 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-08 12:15:23,810 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-08 12:15:23,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,810 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-08 12:15:23,810 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-08 12:15:23,811 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-08 12:15:23,811 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-08 12:15:23,812 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-08 12:15:23,812 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-08 12:15:23,813 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-08 12:15:23,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,813 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-08 12:15:23,814 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-08 12:15:23,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,814 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-08 12:15:23,815 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-08 12:15:23,815 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-08 12:15:23,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,815 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-08 12:15:23,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-08 12:15:23,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 12:15:23,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 12:15:23,817 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-08 12:15:23,817 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-08 12:15:23,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-08 12:15:23,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-08 12:15:23,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 12:15:23,818 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-08 12:15:23,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-08 12:15:23,818 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-08 12:15:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307054710] [2022-04-08 12:15:23,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:15:23,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148159324] [2022-04-08 12:15:23,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148159324] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 12:15:23,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:15:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-08 12:15:23,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:23,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950077194] [2022-04-08 12:15:23,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950077194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:23,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:23,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:15:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194954221] [2022-04-08 12:15:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:23,821 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-08 12:15:23,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:23,822 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-08 12:15:23,842 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-08 12:15:23,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:15:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:15:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:15:23,845 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-08 12:15:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:24,078 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-08 12:15:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:15:24,078 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-08 12:15:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:24,078 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-08 12:15:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 12:15:24,079 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-08 12:15:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 12:15:24,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 12:15:24,125 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-08 12:15:24,126 INFO L225 Difference]: With dead ends: 61 [2022-04-08 12:15:24,126 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 12:15:24,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:15:24,127 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-08 12:15:24,127 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-08 12:15:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 12:15:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-08 12:15:24,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:24,170 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-08 12:15:24,171 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-08 12:15:24,171 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-08 12:15:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:24,173 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-08 12:15:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-08 12:15:24,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:24,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:24,173 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-08 12:15:24,174 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-08 12:15:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:24,175 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-08 12:15:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-08 12:15:24,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:24,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:24,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:24,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:24,176 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-08 12:15:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-08 12:15:24,178 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-08 12:15:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:24,178 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-08 12:15:24,178 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-08 12:15:24,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-08 12:15:24,267 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-08 12:15:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-08 12:15:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 12:15:24,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:24,268 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-08 12:15:24,302 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-08 12:15:24,468 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-08 12:15:24,469 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-08 12:15:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:24,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765614999] [2022-04-08 12:15:24,470 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-08 12:15:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:24,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011104513] [2022-04-08 12:15:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:24,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:24,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514472706] [2022-04-08 12:15:24,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:24,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:24,488 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-08 12:15:24,491 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-08 12:15:24,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:15:24,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:24,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 12:15:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:24,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:24,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-08 12:15:24,824 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-08 12:15:24,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:24,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-08 12:15:24,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-08 12:15:24,824 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-08 12:15:24,824 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-08 12:15:24,824 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-08 12:15:24,825 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-08 12:15:24,825 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-08 12:15:24,825 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-08 12:15:24,825 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-08 12:15:24,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:24,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:24,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:24,826 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2666#(<= 1 main_~x~0)} #80#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-08 12:15:24,827 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-08 12:15:24,827 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-08 12:15:24,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:24,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:24,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:24,827 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-08 12:15:24,828 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-08 12:15:24,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:24,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:24,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:24,828 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-08 12:15:24,829 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-08 12:15:24,829 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-08 12:15:24,829 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-08 12:15:24,830 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-08 12:15:24,830 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-08 12:15:24,830 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-08 12:15:24,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:24,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:24,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:24,831 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-08 12:15:24,831 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-08 12:15:24,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:24,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:24,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:24,832 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-08 12:15:24,833 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-08 12:15:24,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:24,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-08 12:15:24,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-08 12:15:24,833 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-08 12:15:24,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:15:25,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-08 12:15:25,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-08 12:15:25,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:25,038 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-08 12:15:25,039 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-08 12:15:25,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:25,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:25,039 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-08 12:15:25,040 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-08 12:15:25,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:25,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:25,040 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-08 12:15:25,041 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-08 12:15:25,042 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-08 12:15:25,045 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-08 12:15:25,045 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-08 12:15:25,046 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-08 12:15:25,048 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-08 12:15:25,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:25,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:25,048 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-08 12:15:25,049 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-08 12:15:25,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:25,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:25,049 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-08 12:15:25,049 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-08 12:15:25,050 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:25,050 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-08 12:15:25,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 12:15:25,050 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-08 12:15:25,050 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-08 12:15:25,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-08 12:15:25,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 12:15:25,050 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-08 12:15:25,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-08 12:15:25,051 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-08 12:15:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:15:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011104513] [2022-04-08 12:15:25,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:15:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514472706] [2022-04-08 12:15:25,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514472706] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 12:15:25,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:15:25,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-08 12:15:25,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:15:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765614999] [2022-04-08 12:15:25,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765614999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:15:25,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:15:25,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:15:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006467563] [2022-04-08 12:15:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:15:25,052 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-08 12:15:25,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:15:25,052 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-08 12:15:25,086 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-08 12:15:25,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:15:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:25,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:15:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:15:25,087 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-08 12:15:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:25,293 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-08 12:15:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:15:25,293 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-08 12:15:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:15:25,293 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-08 12:15:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 12:15:25,294 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-08 12:15:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 12:15:25,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 12:15:25,342 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-08 12:15:25,343 INFO L225 Difference]: With dead ends: 65 [2022-04-08 12:15:25,343 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 12:15:25,344 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-08 12:15:25,344 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-08 12:15:25,344 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-08 12:15:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 12:15:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 12:15:25,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:15:25,396 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-08 12:15:25,396 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-08 12:15:25,396 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-08 12:15:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:25,398 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-08 12:15:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-08 12:15:25,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:25,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:25,399 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-08 12:15:25,399 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-08 12:15:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:15:25,401 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-08 12:15:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-08 12:15:25,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:15:25,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:15:25,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:15:25,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:15:25,401 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-08 12:15:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-08 12:15:25,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-08 12:15:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:15:25,403 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-08 12:15:25,403 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-08 12:15:25,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-08 12:15:25,470 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-08 12:15:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-08 12:15:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 12:15:25,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:15:25,471 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-08 12:15:25,487 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-08 12:15:25,687 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-08 12:15:25,689 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:15:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:15:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-08 12:15:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:15:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259036016] [2022-04-08 12:15:25,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:15:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-08 12:15:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:15:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660714326] [2022-04-08 12:15:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:15:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:15:25,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:15:25,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343047461] [2022-04-08 12:15:25,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:15:25,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:15:25,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:15:25,716 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-08 12:15:25,716 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-08 12:15:25,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:15:25,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:15:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:15:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:15:25,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:15:26,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-08 12:15:26,017 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-08 12:15:26,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 12:15:26,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-08 12:15:26,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-08 12:15:26,017 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-08 12:15:26,017 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-08 12:15:26,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 12:15:26,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 12:15:26,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 12:15:26,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-08 12:15:26,018 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-08 12:15:26,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 12:15:26,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 12:15:26,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 12:15:26,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-08 12:15:26,019 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-08 12:15:26,019 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-08 12:15:26,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 12:15:26,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 12:15:26,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 12:15:26,020 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-08 12:15:26,020 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-08 12:15:26,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 12:15:26,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 12:15:26,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 12:15:26,022 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-08 12:15:26,022 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-08 12:15:26,023 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-08 12:15:26,023 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-08 12:15:26,024 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-08 12:15:26,024 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-08 12:15:26,024 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-08 12:15:26,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 12:15:26,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 12:15:26,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 12:15:26,025 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-08 12:15:26,025 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-08 12:15:26,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:26,026 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-08 12:15:26,026 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-08 12:15:26,027 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-08 12:15:26,027 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-08 12:15:26,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:26,027 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-08 12:15:26,028 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-08 12:15:26,028 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-08 12:15:26,029 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-08 12:15:26,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:15:26,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-08 12:15:26,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-08 12:15:26,030 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-08 12:15:26,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:23,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:23,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660714326] [2022-04-08 12:16:23,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:23,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343047461] [2022-04-08 12:16:23,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343047461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:16:23,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:16:23,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 12:16:23,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:23,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259036016] [2022-04-08 12:16:23,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259036016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:23,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:23,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:16:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626108682] [2022-04-08 12:16:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:23,838 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-08 12:16:23,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:23,839 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-08 12:16:23,881 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-08 12:16:23,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:16:23,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:23,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:16:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:16:23,882 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-08 12:16:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:24,350 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-08 12:16:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:16:24,350 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-08 12:16:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:24,351 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-08 12:16:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 12:16:24,352 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-08 12:16:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 12:16:24,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-08 12:16:24,410 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-08 12:16:24,411 INFO L225 Difference]: With dead ends: 69 [2022-04-08 12:16:24,411 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 12:16:24,412 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-08 12:16:24,412 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:16:24,412 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.2s Time] [2022-04-08 12:16:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 12:16:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-08 12:16:24,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:24,469 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-08 12:16:24,469 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-08 12:16:24,470 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-08 12:16:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:24,471 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-08 12:16:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-08 12:16:24,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:24,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:24,472 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-08 12:16:24,472 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-08 12:16:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:24,474 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-08 12:16:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-08 12:16:24,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:24,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:24,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:24,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:24,475 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-08 12:16:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-08 12:16:24,476 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-08 12:16:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:24,476 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-08 12:16:24,477 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-08 12:16:24,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-08 12:16:24,562 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-08 12:16:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-08 12:16:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 12:16:24,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:24,563 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-08 12:16:24,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 12:16:24,763 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-08 12:16:24,764 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-08 12:16:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:24,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1721507234] [2022-04-08 12:16:24,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-08 12:16:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649424912] [2022-04-08 12:16:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:24,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:24,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592190290] [2022-04-08 12:16:24,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:16:24,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:24,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:24,779 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-08 12:16:24,779 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-08 12:16:24,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:16:24,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:24,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:16:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:24,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:25,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-08 12:16:25,022 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-08 12:16:25,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-08 12:16:25,023 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-08 12:16:25,023 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-08 12:16:25,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-08 12:16:25,023 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-08 12:16:25,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-08 12:16:25,023 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-08 12:16:25,024 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-08 12:16:25,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-08 12:16:25,024 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-08 12:16:25,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-08 12:16:25,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 5);havoc #t~post6; {3879#true} is VALID [2022-04-08 12:16:25,025 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-08 12:16:25,025 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-08 12:16:25,025 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-08 12:16:25,026 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-08 12:16:25,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,051 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-08 12:16:25,051 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-08 12:16:25,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,051 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-08 12:16:25,051 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-08 12:16:25,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,052 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-08 12:16:25,052 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-08 12:16:25,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:25,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:25,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:25,053 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-08 12:16:25,054 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-08 12:16:25,054 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-08 12:16:25,055 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-08 12:16:25,055 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-08 12:16:25,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:25,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-08 12:16:25,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-08 12:16:25,056 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-08 12:16:25,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:46,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-08 12:16:46,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-08 12:16:46,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:46,083 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-08 12:16:46,084 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-08 12:16:46,084 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-08 12:16:46,085 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-08 12:16:46,086 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-08 12:16:46,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,086 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-08 12:16:46,087 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-08 12:16:46,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,087 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-08 12:16:46,087 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-08 12:16:46,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,088 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-08 12:16:46,088 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-08 12:16:46,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,088 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-08 12:16:46,089 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-08 12:16:46,089 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-08 12:16:46,090 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-08 12:16:46,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 5);havoc #t~post6; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,090 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-08 12:16:46,090 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,090 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-08 12:16:46,090 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-08 12:16:46,090 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,091 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-08 12:16:46,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-08 12:16:46,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 12:16:46,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 12:16:46,091 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-08 12:16:46,091 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-08 12:16:46,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-08 12:16:46,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-08 12:16:46,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 12:16:46,091 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-08 12:16:46,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-08 12:16:46,091 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-08 12:16:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:46,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649424912] [2022-04-08 12:16:46,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:46,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592190290] [2022-04-08 12:16:46,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592190290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:16:46,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:16:46,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-08 12:16:46,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:46,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1721507234] [2022-04-08 12:16:46,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1721507234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:46,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:46,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:16:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537670300] [2022-04-08 12:16:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:46,093 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-08 12:16:46,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:46,094 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-08 12:16:46,124 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-08 12:16:46,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:16:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:16:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 12:16:46,126 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-08 12:16:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:46,616 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-08 12:16:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:16:46,617 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-08 12:16:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:46,617 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-08 12:16:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-08 12:16:46,618 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-08 12:16:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-08 12:16:46,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-08 12:16:46,677 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-08 12:16:46,679 INFO L225 Difference]: With dead ends: 96 [2022-04-08 12:16:46,679 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 12:16:46,680 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-08 12:16:46,680 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-08 12:16:46,680 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-08 12:16:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 12:16:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-08 12:16:46,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:46,756 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-08 12:16:46,756 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-08 12:16:46,756 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-08 12:16:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:46,759 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-08 12:16:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-08 12:16:46,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:46,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:46,760 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-08 12:16:46,760 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-08 12:16:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:46,762 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-08 12:16:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-08 12:16:46,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:46,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:46,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:46,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:46,763 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-08 12:16:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-08 12:16:46,766 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-08 12:16:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:46,766 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-08 12:16:46,766 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-08 12:16:46,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-08 12:16:46,890 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-08 12:16:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-08 12:16:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 12:16:46,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:46,891 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-08 12:16:46,912 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-08 12:16:47,092 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-08 12:16:47,092 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-08 12:16:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330727349] [2022-04-08 12:16:47,093 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-08 12:16:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127060258] [2022-04-08 12:16:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:47,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:47,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541217490] [2022-04-08 12:16:47,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:16:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:47,113 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-08 12:16:47,114 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-08 12:16:47,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:16:47,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:47,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:16:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:47,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:47,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-08 12:16:47,426 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-08 12:16:47,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,428 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-08 12:16:47,428 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-08 12:16:47,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,430 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #78#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,430 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-08 12:16:47,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #80#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,432 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-08 12:16:47,432 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-08 12:16:47,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,434 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #82#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,434 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-08 12:16:47,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,436 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #84#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:47,436 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-08 12:16:47,437 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-08 12:16:47,437 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-08 12:16:47,437 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-08 12:16:47,438 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-08 12:16:47,438 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-08 12:16:47,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,440 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #86#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,441 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-08 12:16:47,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,442 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #88#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,443 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-08 12:16:47,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,444 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #90#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,445 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-08 12:16:47,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,447 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #92#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,447 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-08 12:16:47,448 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-08 12:16:47,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {4959#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {4790#false} is VALID [2022-04-08 12:16:47,448 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-08 12:16:47,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-08 12:16:47,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-08 12:16:47,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-08 12:16:47,448 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-08 12:16:47,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:47,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-08 12:16:47,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-08 12:16:47,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-08 12:16:47,702 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-08 12:16:47,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {4790#false} is VALID [2022-04-08 12:16:47,703 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-08 12:16:47,703 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-08 12:16:47,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 5)} is VALID [2022-04-08 12:16:47,705 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #92#return; {4991#(< ~counter~0 5)} is VALID [2022-04-08 12:16:47,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,706 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-08 12:16:47,706 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #90#return; {4991#(< ~counter~0 5)} is VALID [2022-04-08 12:16:47,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,707 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-08 12:16:47,707 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #88#return; {4991#(< ~counter~0 5)} is VALID [2022-04-08 12:16:47,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,708 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-08 12:16:47,708 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #86#return; {4991#(< ~counter~0 5)} is VALID [2022-04-08 12:16:47,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,708 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-08 12:16:47,731 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-08 12:16:47,732 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-08 12:16:47,733 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-08 12:16:47,733 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-08 12:16:47,733 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-08 12:16:47,734 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #84#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,734 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-08 12:16:47,735 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #82#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,735 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-08 12:16:47,736 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-08 12:16:47,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #80#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,736 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-08 12:16:47,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #78#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 12:16:47,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 12:16:47,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 12:16:47,737 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-08 12:16:47,738 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-08 12:16:47,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {4886#(<= ~counter~0 2)} call #t~ret8 := main(); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4886#(<= ~counter~0 2)} {4789#true} #98#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:47,739 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-08 12:16:47,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-08 12:16:47,740 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-08 12:16:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127060258] [2022-04-08 12:16:47,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541217490] [2022-04-08 12:16:47,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541217490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:16:47,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:16:47,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 12:16:47,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330727349] [2022-04-08 12:16:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330727349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:47,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:47,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:16:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730741156] [2022-04-08 12:16:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:47,742 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-08 12:16:47,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:47,742 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-08 12:16:47,783 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-08 12:16:47,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:16:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:47,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:16:47,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:16:47,784 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-08 12:16:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:48,021 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-08 12:16:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:16:48,021 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-08 12:16:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:48,022 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-08 12:16:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-08 12:16:48,023 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-08 12:16:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-08 12:16:48,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-08 12:16:48,079 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-08 12:16:48,082 INFO L225 Difference]: With dead ends: 111 [2022-04-08 12:16:48,082 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 12:16:48,082 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-08 12:16:48,083 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-08 12:16:48,083 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-08 12:16:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 12:16:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 12:16:48,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:48,201 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-08 12:16:48,201 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-08 12:16:48,202 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-08 12:16:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:48,204 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-08 12:16:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-08 12:16:48,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:48,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:48,204 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-08 12:16:48,204 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-08 12:16:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:48,206 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-08 12:16:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-08 12:16:48,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:48,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:48,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:48,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:48,207 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-08 12:16:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-08 12:16:48,209 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-08 12:16:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:48,209 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-08 12:16:48,209 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-08 12:16:48,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-08 12:16:48,372 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-08 12:16:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-08 12:16:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 12:16:48,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:48,373 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-08 12:16:48,392 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-08 12:16:48,573 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-08 12:16:48,574 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-08 12:16:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:48,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413183902] [2022-04-08 12:16:48,575 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-08 12:16:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:48,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580337347] [2022-04-08 12:16:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:48,586 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:48,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635610257] [2022-04-08 12:16:48,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:16:48,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:48,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:48,587 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-08 12:16:48,589 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-08 12:16:48,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:16:48,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:48,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:16:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:48,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:48,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-08 12:16:48,826 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-08 12:16:48,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #98#return; {5793#true} is VALID [2022-04-08 12:16:48,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret8 := main(); {5793#true} is VALID [2022-04-08 12:16:48,826 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-08 12:16:48,826 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-08 12:16:48,826 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-08 12:16:48,827 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-08 12:16:48,827 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-08 12:16:48,827 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-08 12:16:48,828 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-08 12:16:48,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,828 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5793#true} {5830#(<= 1 main_~x~0)} #80#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-08 12:16:48,829 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-08 12:16:48,829 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-08 12:16:48,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,829 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #82#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-08 12:16:48,829 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-08 12:16:48,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,830 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #84#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-08 12:16:48,830 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-08 12:16:48,830 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-08 12:16:48,831 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-08 12:16:48,831 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-08 12:16:48,831 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-08 12:16:48,831 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-08 12:16:48,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,832 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #86#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:48,832 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-08 12:16:48,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,833 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #88#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:48,833 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-08 12:16:48,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,834 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #90#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:48,834 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-08 12:16:48,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:48,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:48,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:48,835 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #92#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:48,835 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-08 12:16:48,836 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-08 12:16:48,836 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-08 12:16:48,836 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-08 12:16:48,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {5962#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5794#false} is VALID [2022-04-08 12:16:48,837 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-08 12:16:48,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-08 12:16:48,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-08 12:16:48,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-08 12:16:48,837 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-08 12:16:48,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:49,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-08 12:16:49,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-08 12:16:49,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-08 12:16:49,112 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-08 12:16:49,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {5962#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5794#false} is VALID [2022-04-08 12:16:49,113 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-08 12:16:49,113 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-08 12:16:49,113 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-08 12:16:49,114 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-08 12:16:49,114 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #92#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:49,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,114 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-08 12:16:49,115 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #90#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:49,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,126 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-08 12:16:49,128 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #88#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:49,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,128 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-08 12:16:49,129 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #86#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-08 12:16:49,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,129 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-08 12:16:49,129 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-08 12:16:49,130 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-08 12:16:49,130 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-08 12:16:49,130 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-08 12:16:49,130 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-08 12:16:49,131 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #84#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-08 12:16:49,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,131 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-08 12:16:49,131 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #82#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-08 12:16:49,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,132 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-08 12:16:49,132 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-08 12:16:49,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5793#true} {5830#(<= 1 main_~x~0)} #80#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-08 12:16:49,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-08 12:16:49,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-08 12:16:49,133 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-08 12:16:49,133 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-08 12:16:49,134 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-08 12:16:49,134 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-08 12:16:49,134 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-08 12:16:49,134 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-08 12:16:49,134 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-08 12:16:49,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret8 := main(); {5793#true} is VALID [2022-04-08 12:16:49,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #98#return; {5793#true} is VALID [2022-04-08 12:16:49,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-08 12:16:49,135 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-08 12:16:49,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-08 12:16:49,135 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-08 12:16:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580337347] [2022-04-08 12:16:49,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635610257] [2022-04-08 12:16:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635610257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:16:49,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:16:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 12:16:49,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:49,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413183902] [2022-04-08 12:16:49,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413183902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:49,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:49,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:16:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633378031] [2022-04-08 12:16:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:49,136 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-08 12:16:49,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:49,137 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-08 12:16:49,166 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-08 12:16:49,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:16:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:16:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:16:49,167 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-08 12:16:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:50,130 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-08 12:16:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:16:50,130 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-08 12:16:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:50,131 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-08 12:16:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-08 12:16:50,133 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-08 12:16:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-08 12:16:50,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-08 12:16:50,254 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-08 12:16:50,257 INFO L225 Difference]: With dead ends: 182 [2022-04-08 12:16:50,257 INFO L226 Difference]: Without dead ends: 174 [2022-04-08 12:16:50,258 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-08 12:16:50,258 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-08 12:16:50,258 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-08 12:16:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-08 12:16:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-08 12:16:50,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:50,467 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-08 12:16:50,467 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-08 12:16:50,467 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-08 12:16:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:50,472 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-08 12:16:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-08 12:16:50,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:50,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:50,473 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-08 12:16:50,473 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-08 12:16:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:50,477 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-08 12:16:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-08 12:16:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:50,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:50,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:50,479 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-08 12:16:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-08 12:16:50,482 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-08 12:16:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:50,482 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-08 12:16:50,482 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-08 12:16:50,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-08 12:16:50,731 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-08 12:16:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-08 12:16:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 12:16:50,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:50,734 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-08 12:16:50,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 12:16:50,939 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-08 12:16:50,939 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-08 12:16:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:50,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579173945] [2022-04-08 12:16:50,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-08 12:16:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:50,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986833068] [2022-04-08 12:16:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:50,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:50,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16822517] [2022-04-08 12:16:50,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:16:50,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:50,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:50,973 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-08 12:16:50,974 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-08 12:16:51,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:16:51,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:51,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:16:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:51,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:51,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {7185#true} call ULTIMATE.init(); {7185#true} is VALID [2022-04-08 12:16:51,276 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-08 12:16:51,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7193#(<= ~counter~0 0)} {7185#true} #98#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {7193#(<= ~counter~0 0)} call #t~ret8 := main(); {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,277 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-08 12:16:51,277 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-08 12:16:51,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #78#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,279 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-08 12:16:51,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #80#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,280 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-08 12:16:51,281 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-08 12:16:51,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,284 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #82#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,284 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-08 12:16:51,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,285 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #84#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:51,286 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-08 12:16:51,286 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-08 12:16:51,286 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-08 12:16:51,287 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-08 12:16:51,287 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-08 12:16:51,288 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-08 12:16:51,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,289 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #86#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,290 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-08 12:16:51,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,291 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #88#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,292 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-08 12:16:51,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,292 INFO L290 TraceCheckUtils]: 45: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,293 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #90#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,294 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-08 12:16:51,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,295 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #92#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,295 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-08 12:16:51,296 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-08 12:16:51,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {7352#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {7186#false} is VALID [2022-04-08 12:16:51,296 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-08 12:16:51,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7186#false} is VALID [2022-04-08 12:16:51,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {7186#false} assume !(#t~post6 < 5);havoc #t~post6; {7186#false} is VALID [2022-04-08 12:16:51,296 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-08 12:16:51,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {7186#false} ~cond := #in~cond; {7186#false} is VALID [2022-04-08 12:16:51,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {7186#false} assume 0 == ~cond; {7186#false} is VALID [2022-04-08 12:16:51,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-04-08 12:16:51,297 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-08 12:16:51,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:51,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-04-08 12:16:51,536 INFO L290 TraceCheckUtils]: 60: Hoare triple {7186#false} assume 0 == ~cond; {7186#false} is VALID [2022-04-08 12:16:51,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {7186#false} ~cond := #in~cond; {7186#false} is VALID [2022-04-08 12:16:51,536 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-08 12:16:51,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {7186#false} assume !(#t~post6 < 5);havoc #t~post6; {7186#false} is VALID [2022-04-08 12:16:51,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7186#false} is VALID [2022-04-08 12:16:51,536 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-08 12:16:51,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {7186#false} is VALID [2022-04-08 12:16:51,537 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-08 12:16:51,537 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-08 12:16:51,538 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #92#return; {7402#(< ~counter~0 5)} is VALID [2022-04-08 12:16:51,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,538 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-08 12:16:51,539 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #90#return; {7402#(< ~counter~0 5)} is VALID [2022-04-08 12:16:51,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,539 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-08 12:16:51,540 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #88#return; {7402#(< ~counter~0 5)} is VALID [2022-04-08 12:16:51,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,540 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-08 12:16:51,541 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #86#return; {7402#(< ~counter~0 5)} is VALID [2022-04-08 12:16:51,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,541 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-08 12:16:51,541 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-08 12:16:51,542 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-08 12:16:51,542 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-08 12:16:51,542 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-08 12:16:51,543 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-08 12:16:51,543 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #84#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,543 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-08 12:16:51,544 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #82#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,544 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-08 12:16:51,545 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-08 12:16:51,546 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #80#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,546 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-08 12:16:51,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #78#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-08 12:16:51,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-08 12:16:51,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-08 12:16:51,572 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-08 12:16:51,572 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-08 12:16:51,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {7282#(<= ~counter~0 2)} call #t~ret8 := main(); {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7282#(<= ~counter~0 2)} {7185#true} #98#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:51,574 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-08 12:16:51,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {7185#true} call ULTIMATE.init(); {7185#true} is VALID [2022-04-08 12:16:51,574 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-08 12:16:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986833068] [2022-04-08 12:16:51,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16822517] [2022-04-08 12:16:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16822517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:16:51,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:16:51,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 12:16:51,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:51,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579173945] [2022-04-08 12:16:51,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579173945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:51,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:51,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:16:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387529360] [2022-04-08 12:16:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:51,575 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-08 12:16:51,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:51,575 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-08 12:16:51,607 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-08 12:16:51,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:16:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:51,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:16:51,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:16:51,608 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-08 12:16:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:51,995 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-08 12:16:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:16:51,995 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-08 12:16:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:51,996 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-08 12:16:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-08 12:16:51,998 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-08 12:16:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-08 12:16:51,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-08 12:16:52,067 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-08 12:16:52,069 INFO L225 Difference]: With dead ends: 183 [2022-04-08 12:16:52,070 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 12:16:52,071 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-08 12:16:52,071 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-08 12:16:52,071 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-08 12:16:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 12:16:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 12:16:52,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:52,291 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-08 12:16:52,292 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-08 12:16:52,292 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-08 12:16:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:52,296 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-08 12:16:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-08 12:16:52,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:52,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:52,299 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-08 12:16:52,299 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-08 12:16:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:52,304 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-08 12:16:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-08 12:16:52,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:52,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:52,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:52,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:52,305 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-08 12:16:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-08 12:16:52,310 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-08 12:16:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:52,310 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-08 12:16:52,310 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-08 12:16:52,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-08 12:16:52,556 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-08 12:16:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-08 12:16:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 12:16:52,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:52,557 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-08 12:16:52,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 12:16:52,757 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-08 12:16:52,757 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-08 12:16:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:52,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2133136234] [2022-04-08 12:16:52,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-08 12:16:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:52,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753608965] [2022-04-08 12:16:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:52,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:52,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460365425] [2022-04-08 12:16:52,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:16:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:52,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:52,772 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-08 12:16:52,773 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-08 12:16:52,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:16:52,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:52,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:16:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:52,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:53,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-08 12:16:53,099 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-08 12:16:53,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8525#(<= ~counter~0 0)} {8517#true} #98#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {8525#(<= ~counter~0 0)} call #t~ret8 := main(); {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,100 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-08 12:16:53,101 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-08 12:16:53,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #78#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,102 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-08 12:16:53,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,103 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #80#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,104 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-08 12:16:53,104 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-08 12:16:53,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,105 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #82#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,106 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-08 12:16:53,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,107 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #84#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-08 12:16:53,107 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-08 12:16:53,108 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-08 12:16:53,108 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-08 12:16:53,108 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-08 12:16:53,109 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-08 12:16:53,109 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-08 12:16:53,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,110 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #86#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,111 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-08 12:16:53,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,112 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #88#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,113 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-08 12:16:53,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,114 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #90#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,115 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-08 12:16:53,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,116 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #92#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {8614#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8614#(<= ~counter~0 2)} is VALID [2022-04-08 12:16:53,117 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-08 12:16:53,118 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-08 12:16:53,118 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-08 12:16:53,118 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-08 12:16:53,119 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-08 12:16:53,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {8697#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {8518#false} is VALID [2022-04-08 12:16:53,119 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-08 12:16:53,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {8518#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8518#false} is VALID [2022-04-08 12:16:53,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {8518#false} assume !(#t~post6 < 5);havoc #t~post6; {8518#false} is VALID [2022-04-08 12:16:53,119 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-08 12:16:53,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-08 12:16:53,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-08 12:16:53,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-08 12:16:53,120 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-08 12:16:53,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:16:53,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-08 12:16:53,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-08 12:16:53,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-08 12:16:53,410 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-08 12:16:53,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {8518#false} assume !(#t~post6 < 5);havoc #t~post6; {8518#false} is VALID [2022-04-08 12:16:53,411 INFO L290 TraceCheckUtils]: 60: Hoare triple {8518#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8518#false} is VALID [2022-04-08 12:16:53,411 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-08 12:16:53,411 INFO L290 TraceCheckUtils]: 58: Hoare triple {8743#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {8518#false} is VALID [2022-04-08 12:16:53,411 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-08 12:16:53,411 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-08 12:16:53,412 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-08 12:16:53,412 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-08 12:16:53,413 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-08 12:16:53,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {8687#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {8687#(<= ~counter~0 3)} is VALID [2022-04-08 12:16:53,413 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #92#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-08 12:16:53,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,414 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-08 12:16:53,414 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #90#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-08 12:16:53,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,414 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-08 12:16:53,415 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #88#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-08 12:16:53,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,415 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-08 12:16:53,416 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #86#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-08 12:16:53,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,416 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-08 12:16:53,416 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-08 12:16:53,417 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-08 12:16:53,417 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-08 12:16:53,422 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-08 12:16:53,422 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-08 12:16:53,423 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #84#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,423 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-08 12:16:53,424 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #82#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,424 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-08 12:16:53,424 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-08 12:16:53,425 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #80#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,425 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-08 12:16:53,425 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #78#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 12:16:53,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 12:16:53,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 12:16:53,425 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-08 12:16:53,426 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-08 12:16:53,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {8604#(<= ~counter~0 1)} call #t~ret8 := main(); {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8604#(<= ~counter~0 1)} {8517#true} #98#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {8604#(<= ~counter~0 1)} assume true; {8604#(<= ~counter~0 1)} is VALID [2022-04-08 12:16:53,427 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-08 12:16:53,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-08 12:16:53,427 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-08 12:16:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:16:53,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753608965] [2022-04-08 12:16:53,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:16:53,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460365425] [2022-04-08 12:16:53,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460365425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:16:53,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:16:53,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 12:16:53,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:16:53,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2133136234] [2022-04-08 12:16:53,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2133136234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:16:53,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:16:53,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:16:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927978475] [2022-04-08 12:16:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:16:53,429 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-08 12:16:53,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:16:53,429 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-08 12:16:53,467 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-08 12:16:53,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:16:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:16:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:16:53,468 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-08 12:16:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:54,025 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-08 12:16:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:16:54,025 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-08 12:16:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:16:54,026 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-08 12:16:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 12:16:54,027 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-08 12:16:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 12:16:54,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-08 12:16:54,115 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-08 12:16:54,118 INFO L225 Difference]: With dead ends: 253 [2022-04-08 12:16:54,118 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 12:16:54,121 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-08 12:16:54,121 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-08 12:16:54,121 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-08 12:16:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 12:16:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-08 12:16:54,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:16:54,416 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-08 12:16:54,416 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-08 12:16:54,416 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-08 12:16:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:54,420 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-08 12:16:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-08 12:16:54,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:54,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:54,421 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-08 12:16:54,422 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-08 12:16:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:16:54,427 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-08 12:16:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-08 12:16:54,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:16:54,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:16:54,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:16:54,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:16:54,428 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-08 12:16:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-08 12:16:54,432 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-08 12:16:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:16:54,433 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-08 12:16:54,436 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-08 12:16:54,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-08 12:16:54,686 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-08 12:16:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-08 12:16:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 12:16:54,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:16:54,686 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-08 12:16:54,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 12:16:54,903 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-08 12:16:54,904 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:16:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:16:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-08 12:16:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:16:54,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40085075] [2022-04-08 12:16:54,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:16:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-08 12:16:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:16:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414482243] [2022-04-08 12:16:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:16:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:16:54,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:16:54,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334649721] [2022-04-08 12:16:54,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:16:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:16:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:16:54,918 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-08 12:16:54,919 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-08 12:16:54,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:16:54,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:16:54,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 12:16:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:16:54,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:16:55,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {10119#true} call ULTIMATE.init(); {10119#true} is VALID [2022-04-08 12:16:55,306 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-08 12:16:55,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10119#true} {10119#true} #98#return; {10119#true} is VALID [2022-04-08 12:16:55,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {10119#true} call #t~ret8 := main(); {10119#true} is VALID [2022-04-08 12:16:55,307 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-08 12:16:55,307 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-08 12:16:55,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10119#true} {10119#true} #78#return; {10119#true} is VALID [2022-04-08 12:16:55,307 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-08 12:16:55,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10119#true} {10119#true} #80#return; {10119#true} is VALID [2022-04-08 12:16:55,308 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-08 12:16:55,308 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-08 12:16:55,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,308 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-08 12:16:55,308 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-08 12:16:55,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,309 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-08 12:16:55,309 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-08 12:16:55,310 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-08 12:16:55,310 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-08 12:16:55,310 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-08 12:16:55,311 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-08 12:16:55,311 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-08 12:16:55,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,311 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-08 12:16:55,312 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-08 12:16:55,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,312 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-08 12:16:55,312 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-08 12:16:55,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {10119#true} ~cond := #in~cond; {10255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:55,313 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-08 12:16:55,313 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-08 12:16:55,314 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-08 12:16:55,314 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-08 12:16:55,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,315 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-08 12:16:55,315 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-08 12:16:55,316 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-08 12:16:55,316 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-08 12:16:55,316 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-08 12:16:55,317 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-08 12:16:55,317 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-08 12:16:55,318 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-08 12:16:55,318 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-08 12:16:55,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:16:55,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:16:55,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:16:55,318 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-08 12:16:55,319 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-08 12:16:55,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:16:55,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {10326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10120#false} is VALID [2022-04-08 12:16:55,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-04-08 12:16:55,320 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-08 12:16:55,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:17:12,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-04-08 12:17:12,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {10326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10120#false} is VALID [2022-04-08 12:17:12,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:12,088 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-08 12:17:12,089 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-08 12:17:12,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,089 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-08 12:17:12,089 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-08 12:17:12,090 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-08 12:17:12,090 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-08 12:17:12,090 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-08 12:17:12,091 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-08 12:17:12,091 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-08 12:17:12,092 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-08 12:17:12,092 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-08 12:17:12,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,092 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-08 12:17:12,093 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-08 12:17:12,093 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-08 12:17:12,094 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-08 12:17:12,094 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-08 12:17:12,094 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-08 12:17:12,094 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10119#true} {10119#true} #88#return; {10119#true} is VALID [2022-04-08 12:17:12,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,094 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-08 12:17:12,094 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10119#true} {10119#true} #86#return; {10119#true} is VALID [2022-04-08 12:17:12,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,095 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-08 12:17:12,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {10119#true} assume !!(#t~post7 < 5);havoc #t~post7; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {10119#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10119#true} is VALID [2022-04-08 12:17:12,095 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-08 12:17:12,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {10119#true} assume !!(#t~post6 < 5);havoc #t~post6; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {10119#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10119#true} {10119#true} #84#return; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,095 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-08 12:17:12,095 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10119#true} {10119#true} #82#return; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,095 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-08 12:17:12,095 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-08 12:17:12,096 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10119#true} {10119#true} #80#return; {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,096 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-08 12:17:12,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10119#true} {10119#true} #78#return; {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-08 12:17:12,096 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-08 12:17:12,096 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-08 12:17:12,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {10119#true} call #t~ret8 := main(); {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10119#true} {10119#true} #98#return; {10119#true} is VALID [2022-04-08 12:17:12,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-08 12:17:12,096 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-08 12:17:12,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {10119#true} call ULTIMATE.init(); {10119#true} is VALID [2022-04-08 12:17:12,097 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-08 12:17:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:17:12,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414482243] [2022-04-08 12:17:12,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:17:12,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334649721] [2022-04-08 12:17:12,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334649721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:17:12,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:17:12,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-08 12:17:12,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:17:12,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40085075] [2022-04-08 12:17:12,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40085075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:17:12,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:17:12,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:17:12,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661160117] [2022-04-08 12:17:12,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:17:12,098 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-08 12:17:12,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:17:12,098 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-08 12:17:12,140 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-08 12:17:12,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:17:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:17:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:17:12,141 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-08 12:17:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:13,380 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-08 12:17:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 12:17:13,381 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-08 12:17:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:17:13,381 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-08 12:17:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-08 12:17:13,382 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-08 12:17:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-08 12:17:13,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-08 12:17:13,464 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-08 12:17:13,467 INFO L225 Difference]: With dead ends: 195 [2022-04-08 12:17:13,467 INFO L226 Difference]: Without dead ends: 193 [2022-04-08 12:17:13,467 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-08 12:17:13,468 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:17:13,468 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.4s Time] [2022-04-08 12:17:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-08 12:17:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-08 12:17:13,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:17:13,735 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-08 12:17:13,736 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-08 12:17:13,736 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-08 12:17:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:13,740 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-08 12:17:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-08 12:17:13,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:13,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:13,741 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-08 12:17:13,742 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-08 12:17:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:13,747 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-08 12:17:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-08 12:17:13,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:13,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:13,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:17:13,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:17:13,748 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-08 12:17:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-08 12:17:13,752 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-08 12:17:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:17:13,752 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-08 12:17:13,752 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-08 12:17:13,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-08 12:17:14,062 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-08 12:17:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-08 12:17:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 12:17:14,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:17:14,063 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-08 12:17:14,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 12:17:14,281 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-08 12:17:14,282 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:17:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:17:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-08 12:17:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:14,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599135530] [2022-04-08 12:17:14,282 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:17:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-08 12:17:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:17:14,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405251401] [2022-04-08 12:17:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:17:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:17:14,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:17:14,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492045164] [2022-04-08 12:17:14,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:17:14,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:17:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:17:14,294 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-08 12:17:14,295 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-08 12:17:14,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:17:14,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:17:14,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:17:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:17:14,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:17:14,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {11703#true} call ULTIMATE.init(); {11703#true} is VALID [2022-04-08 12:17:14,866 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-08 12:17:14,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11703#true} {11703#true} #98#return; {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {11703#true} call #t~ret8 := main(); {11703#true} is VALID [2022-04-08 12:17:14,866 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-08 12:17:14,866 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-08 12:17:14,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11703#true} {11703#true} #78#return; {11703#true} is VALID [2022-04-08 12:17:14,866 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-08 12:17:14,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,867 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11703#true} {11703#true} #80#return; {11703#true} is VALID [2022-04-08 12:17:14,867 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-08 12:17:14,868 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-08 12:17:14,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,868 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-08 12:17:14,869 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-08 12:17:14,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,869 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-08 12:17:14,870 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-08 12:17:14,870 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-08 12:17:14,870 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-08 12:17:14,871 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-08 12:17:14,871 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-08 12:17:14,871 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-08 12:17:14,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,872 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-08 12:17:14,872 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-08 12:17:14,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,873 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-08 12:17:14,873 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-08 12:17:14,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,874 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-08 12:17:14,874 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-08 12:17:14,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,874 INFO L290 TraceCheckUtils]: 49: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,875 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-08 12:17:14,876 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-08 12:17:14,876 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-08 12:17:14,879 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-08 12:17:14,880 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-08 12:17:14,880 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-08 12:17:14,880 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-08 12:17:14,881 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-08 12:17:14,881 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-08 12:17:14,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,882 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-08 12:17:14,882 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-08 12:17:14,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:14,882 INFO L290 TraceCheckUtils]: 66: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:14,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:14,883 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-08 12:17:14,883 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-08 12:17:14,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:14,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {11922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11704#false} is VALID [2022-04-08 12:17:14,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {11704#false} assume !false; {11704#false} is VALID [2022-04-08 12:17:14,884 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-08 12:17:14,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:17:15,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {11704#false} assume !false; {11704#false} is VALID [2022-04-08 12:17:15,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {11922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11704#false} is VALID [2022-04-08 12:17:15,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:15,210 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-08 12:17:15,210 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-08 12:17:15,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:15,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:15,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:15,211 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-08 12:17:15,211 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-08 12:17:15,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:15,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:15,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:15,211 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-08 12:17:15,212 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-08 12:17:15,212 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-08 12:17:15,213 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-08 12:17:15,213 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-08 12:17:15,213 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-08 12:17:16,299 INFO 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 VALID [2022-04-08 12:17:16,300 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-08 12:17:16,301 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-08 12:17:16,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,301 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-08 12:17:16,302 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-08 12:17:16,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,302 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-08 12:17:16,303 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-08 12:17:16,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,303 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-08 12:17:16,303 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-08 12:17:16,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,304 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-08 12:17:16,304 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-08 12:17:16,305 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-08 12:17:16,305 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-08 12:17:16,305 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-08 12:17:16,306 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-08 12:17:16,306 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-08 12:17:16,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,307 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-08 12:17:16,307 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-08 12:17:16,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,308 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-08 12:17:16,308 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-08 12:17:16,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11703#true} {11703#true} #80#return; {11703#true} is VALID [2022-04-08 12:17:16,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,308 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-08 12:17:16,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11703#true} {11703#true} #78#return; {11703#true} is VALID [2022-04-08 12:17:16,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-08 12:17:16,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-08 12:17:16,309 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-08 12:17:16,309 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-08 12:17:16,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {11703#true} call #t~ret8 := main(); {11703#true} is VALID [2022-04-08 12:17:16,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11703#true} {11703#true} #98#return; {11703#true} is VALID [2022-04-08 12:17:16,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-08 12:17:16,309 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-08 12:17:16,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {11703#true} call ULTIMATE.init(); {11703#true} is VALID [2022-04-08 12:17:16,309 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-08 12:17:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:17:16,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405251401] [2022-04-08 12:17:16,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:17:16,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492045164] [2022-04-08 12:17:16,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492045164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:17:16,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:17:16,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 12:17:16,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:17:16,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599135530] [2022-04-08 12:17:16,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599135530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:17:16,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:17:16,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:17:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311711889] [2022-04-08 12:17:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:17:16,310 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-08 12:17:16,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:17:16,311 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-08 12:17:16,353 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-08 12:17:16,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:17:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:17:16,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:17:16,354 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-08 12:17:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:17,240 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-08 12:17:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:17:17,241 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-08 12:17:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:17:17,241 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-08 12:17:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-08 12:17:17,243 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-08 12:17:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-08 12:17:17,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-08 12:17:17,347 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-08 12:17:17,350 INFO L225 Difference]: With dead ends: 199 [2022-04-08 12:17:17,351 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 12:17:17,351 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-08 12:17:17,351 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-08 12:17:17,352 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-08 12:17:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 12:17:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-08 12:17:17,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:17:17,634 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-08 12:17:17,634 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-08 12:17:17,634 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-08 12:17:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:17,639 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-08 12:17:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-08 12:17:17,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:17,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:17,640 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-08 12:17:17,640 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-08 12:17:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:17:17,644 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-08 12:17:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-08 12:17:17,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:17:17,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:17:17,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:17:17,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:17:17,645 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-08 12:17:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-08 12:17:17,650 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-08 12:17:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:17:17,650 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-08 12:17:17,650 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-08 12:17:17,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-08 12:17:17,978 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-08 12:17:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-08 12:17:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 12:17:17,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:17:17,979 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-08 12:17:17,998 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-08 12:17:18,195 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-08 12:17:18,195 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:17:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:17:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-08 12:17:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:17:18,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648078536] [2022-04-08 12:17:18,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:17:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-08 12:17:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:17:18,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093519258] [2022-04-08 12:17:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:17:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:17:18,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:17:18,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386694022] [2022-04-08 12:17:18,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:17:18,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:17:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:17:18,208 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-08 12:17:18,214 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-08 12:17:18,267 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:17:18,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:17:18,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 12:17:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:17:18,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:17:20,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {13334#true} call ULTIMATE.init(); {13334#true} is VALID [2022-04-08 12:17:20,586 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-08 12:17:20,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13334#true} {13334#true} #98#return; {13334#true} is VALID [2022-04-08 12:17:20,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {13334#true} call #t~ret8 := main(); {13334#true} is VALID [2022-04-08 12:17:20,586 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-08 12:17:20,586 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-08 12:17:20,587 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-08 12:17:20,587 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-08 12:17:20,587 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-08 12:17:20,588 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-08 12:17:20,588 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-08 12:17:20,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,588 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13334#true} {13371#(<= 1 main_~x~0)} #80#return; {13371#(<= 1 main_~x~0)} is VALID [2022-04-08 12:17:20,589 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-08 12:17:20,589 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-08 12:17:20,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,590 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-08 12:17:20,590 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-08 12:17:20,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,590 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-08 12:17:20,591 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-08 12:17:20,591 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-08 12:17:20,592 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-08 12:17:20,592 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-08 12:17:20,593 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-08 12:17:20,593 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-08 12:17:20,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,594 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-08 12:17:20,594 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-08 12:17:20,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,595 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-08 12:17:20,595 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-08 12:17:20,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,596 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-08 12:17:20,596 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-08 12:17:20,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,597 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-08 12:17:20,598 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-08 12:17:20,598 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-08 12:17:20,599 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-08 12:17:20,599 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-08 12:17:20,599 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-08 12:17:20,600 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-08 12:17:20,600 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-08 12:17:20,600 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-08 12:17:20,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,601 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-08 12:17:20,601 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-08 12:17:20,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-08 12:17:20,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-08 12:17:20,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-08 12:17:20,602 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-08 12:17:20,602 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-08 12:17:20,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {13334#true} ~cond := #in~cond; {13556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:20,603 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-08 12:17:20,603 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-08 12:17:20,604 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-08 12:17:20,604 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-08 12:17:20,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {13570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:17:20,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {13574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13335#false} is VALID [2022-04-08 12:17:20,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {13335#false} assume !false; {13335#false} is VALID [2022-04-08 12:17:20,605 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-08 12:17:20,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:18:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:18:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093519258] [2022-04-08 12:18:11,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:18:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386694022] [2022-04-08 12:18:11,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386694022] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:18:11,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:18:11,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 12:18:11,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:18:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648078536] [2022-04-08 12:18:11,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648078536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:11,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:11,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:18:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874172900] [2022-04-08 12:18:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:18:11,801 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-08 12:18:11,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:18:11,802 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-08 12:18:11,851 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-08 12:18:11,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:18:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:18:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-08 12:18:11,852 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-08 12:18:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:16,919 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-08 12:18:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:18:16,919 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-08 12:18:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:18:16,919 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-08 12:18:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 12:18:16,921 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-08 12:18:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 12:18:16,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-08 12:18:17,063 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-08 12:18:17,067 INFO L225 Difference]: With dead ends: 203 [2022-04-08 12:18:17,067 INFO L226 Difference]: Without dead ends: 201 [2022-04-08 12:18:17,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:18:17,067 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 12:18:17,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 205 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 12:18:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-08 12:18:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-08 12:18:17,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:18:17,361 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-08 12:18:17,361 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-08 12:18:17,361 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-08 12:18:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:17,365 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-08 12:18:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-08 12:18:17,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:17,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:17,366 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-08 12:18:17,366 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-08 12:18:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:17,369 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-08 12:18:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-08 12:18:17,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:17,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:17,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:18:17,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:18:17,370 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-08 12:18:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-08 12:18:17,374 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-08 12:18:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:18:17,374 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-08 12:18:17,374 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-08 12:18:17,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-08 12:18:17,748 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-08 12:18:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-08 12:18:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 12:18:17,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:18:17,763 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-08 12:18:17,789 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-08 12:18:17,964 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-08 12:18:17,964 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:18:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:18:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-08 12:18:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:17,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409051938] [2022-04-08 12:18:17,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:18:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-08 12:18:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:18:17,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418209867] [2022-04-08 12:18:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:18:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:18:17,980 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:18:17,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444671673] [2022-04-08 12:18:17,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:18:17,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:18:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:18:17,981 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-08 12:18:17,982 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-08 12:18:18,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:18:18,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:18:18,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 12:18:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:18:18,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:18:19,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {14811#true} call ULTIMATE.init(); {14811#true} is VALID [2022-04-08 12:18:19,183 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-08 12:18:19,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14811#true} {14811#true} #98#return; {14811#true} is VALID [2022-04-08 12:18:19,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {14811#true} call #t~ret8 := main(); {14811#true} is VALID [2022-04-08 12:18:19,184 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-08 12:18:19,184 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-08 12:18:19,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14811#true} {14811#true} #78#return; {14811#true} is VALID [2022-04-08 12:18:19,184 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-08 12:18:19,185 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-08 12:18:19,185 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-08 12:18:19,185 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-08 12:18:19,186 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-08 12:18:19,186 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-08 12:18:19,186 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-08 12:18:19,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,187 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14811#true} {14867#(<= 1 main_~b~0)} #82#return; {14867#(<= 1 main_~b~0)} is VALID [2022-04-08 12:18:19,187 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-08 12:18:19,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,187 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14811#true} {14867#(<= 1 main_~b~0)} #84#return; {14867#(<= 1 main_~b~0)} is VALID [2022-04-08 12:18:19,187 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-08 12:18:19,188 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-08 12:18:19,188 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-08 12:18:19,188 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-08 12:18:19,189 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-08 12:18:19,189 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-08 12:18:19,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,189 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-08 12:18:19,189 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-08 12:18:19,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,190 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-08 12:18:19,190 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-08 12:18:19,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,191 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-08 12:18:19,191 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-08 12:18:19,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,192 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-08 12:18:19,193 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-08 12:18:19,193 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-08 12:18:19,193 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-08 12:18:19,193 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-08 12:18:19,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {14811#true} ~cond := #in~cond; {14990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:19,194 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-08 12:18:19,194 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-08 12:18:19,195 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-08 12:18:19,195 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-08 12:18:19,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,196 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-08 12:18:19,196 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-08 12:18:19,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,196 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-08 12:18:19,197 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-08 12:18:19,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:19,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:19,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:19,197 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-08 12:18:19,199 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-08 12:18:19,200 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-08 12:18:19,200 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-08 12:18:19,201 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#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:18:19,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:19,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14812#false} is VALID [2022-04-08 12:18:19,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {14812#false} assume !false; {14812#false} is VALID [2022-04-08 12:18:19,202 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-08 12:18:19,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:18:26,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {14812#false} assume !false; {14812#false} is VALID [2022-04-08 12:18:26,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14812#false} is VALID [2022-04-08 12:18:26,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:26,570 INFO L272 TraceCheckUtils]: 78: Hoare triple {15080#(= 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)); {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:18:26,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,572 INFO L290 TraceCheckUtils]: 75: Hoare triple {15080#(= 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; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,573 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14811#true} {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,573 INFO L272 TraceCheckUtils]: 70: Hoare triple {15080#(= 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-08 12:18:26,574 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14811#true} {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,574 INFO L272 TraceCheckUtils]: 65: Hoare triple {15080#(= 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-08 12:18:26,574 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14811#true} {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,575 INFO L272 TraceCheckUtils]: 60: Hoare triple {15080#(= 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-08 12:18:26,575 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} {14811#true} #86#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:18:26,575 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-08 12:18:26,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {15147#(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-08 12:18:26,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {14811#true} ~cond := #in~cond; {15147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:18:26,576 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-08 12:18:26,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {14811#true} assume !!(#t~post7 < 5);havoc #t~post7; {14811#true} is VALID [2022-04-08 12:18:26,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {14811#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14811#true} is VALID [2022-04-08 12:18:26,576 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-08 12:18:26,576 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14811#true} {14811#true} #92#return; {14811#true} is VALID [2022-04-08 12:18:26,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,577 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-08 12:18:26,577 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14811#true} {14811#true} #90#return; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,577 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-08 12:18:26,577 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14811#true} {14811#true} #88#return; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,577 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-08 12:18:26,577 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14811#true} {14811#true} #86#return; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,577 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-08 12:18:26,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {14811#true} assume !!(#t~post7 < 5);havoc #t~post7; {14811#true} is VALID [2022-04-08 12:18:26,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {14811#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14811#true} is VALID [2022-04-08 12:18:26,578 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-08 12:18:26,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {14811#true} assume !!(#t~post6 < 5);havoc #t~post6; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {14811#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14811#true} {14811#true} #84#return; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,578 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-08 12:18:26,578 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14811#true} {14811#true} #82#return; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,578 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-08 12:18:26,578 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-08 12:18:26,578 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14811#true} {14811#true} #80#return; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,579 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-08 12:18:26,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14811#true} {14811#true} #78#return; {14811#true} is VALID [2022-04-08 12:18:26,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-08 12:18:26,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-08 12:18:26,579 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-08 12:18:26,579 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-08 12:18:26,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {14811#true} call #t~ret8 := main(); {14811#true} is VALID [2022-04-08 12:18:26,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14811#true} {14811#true} #98#return; {14811#true} is VALID [2022-04-08 12:18:26,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-08 12:18:26,582 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-08 12:18:26,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {14811#true} call ULTIMATE.init(); {14811#true} is VALID [2022-04-08 12:18:26,583 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-08 12:18:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:18:26,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418209867] [2022-04-08 12:18:26,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:18:26,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444671673] [2022-04-08 12:18:26,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444671673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:18:26,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:18:26,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 16 [2022-04-08 12:18:26,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:18:26,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409051938] [2022-04-08 12:18:26,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409051938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:26,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:26,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:18:26,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780347952] [2022-04-08 12:18:26,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:18:26,584 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-08 12:18:26,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:18:26,584 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-08 12:18:26,626 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-08 12:18:26,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:18:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:26,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:18:26,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:18:26,626 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-08 12:18:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:30,803 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-08 12:18:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:18:30,803 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-08 12:18:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:18:30,803 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-08 12:18:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-08 12:18:30,804 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-08 12:18:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-08 12:18:30,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2022-04-08 12:18:30,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:18:30,931 INFO L225 Difference]: With dead ends: 212 [2022-04-08 12:18:30,931 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 12:18:30,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-08 12:18:30,932 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:18:30,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 240 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 12:18:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 12:18:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-08 12:18:31,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:18:31,295 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-08 12:18:31,295 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-08 12:18:31,295 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-08 12:18:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:31,301 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-08 12:18:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-08 12:18:31,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:31,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:31,302 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-08 12:18:31,302 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-08 12:18:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:31,311 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-08 12:18:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-08 12:18:31,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:31,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:31,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:18:31,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:18:31,312 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-08 12:18:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-08 12:18:31,317 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-08 12:18:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:18:31,317 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-08 12:18:31,318 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-08 12:18:31,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-08 12:18:31,802 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-08 12:18:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-08 12:18:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 12:18:31,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:18:31,803 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-08 12:18:31,819 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-08 12:18:32,020 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-08 12:18:32,021 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:18:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:18:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-08 12:18:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:32,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422135337] [2022-04-08 12:18:32,022 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:18:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-08 12:18:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:18:32,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683097894] [2022-04-08 12:18:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:18:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:18:32,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:18:32,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110709017] [2022-04-08 12:18:32,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:18:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:18:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:18:32,037 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-08 12:18:32,037 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-08 12:18:32,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:18:32,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:18:32,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:18:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:18:32,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:18:32,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {16582#true} call ULTIMATE.init(); {16582#true} is VALID [2022-04-08 12:18:32,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {16582#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; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16590#(<= ~counter~0 0)} {16582#true} #98#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {16590#(<= ~counter~0 0)} call #t~ret8 := main(); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {16590#(<= ~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; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #78#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #80#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {16590#(<= ~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; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,410 INFO L272 TraceCheckUtils]: 17: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,411 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #82#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,412 INFO L272 TraceCheckUtils]: 22: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,413 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #84#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-08 12:18:32,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {16590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {16669#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {16669#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {16669#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {16679#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,415 INFO L272 TraceCheckUtils]: 32: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,417 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #86#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,417 INFO L272 TraceCheckUtils]: 37: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,418 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #88#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,419 INFO L272 TraceCheckUtils]: 42: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,420 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #90#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,421 INFO L272 TraceCheckUtils]: 47: Hoare triple {16679#(<= ~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)); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,422 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #92#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {16679#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {16679#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {16749#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,424 INFO L272 TraceCheckUtils]: 55: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,425 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #86#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,426 INFO L272 TraceCheckUtils]: 60: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,427 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #88#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,427 INFO L272 TraceCheckUtils]: 65: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,428 INFO L290 TraceCheckUtils]: 66: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,429 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #90#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,429 INFO L272 TraceCheckUtils]: 70: Hoare triple {16749#(<= ~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)); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,430 INFO L290 TraceCheckUtils]: 73: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,431 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #92#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,431 INFO L290 TraceCheckUtils]: 75: Hoare triple {16749#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {16749#(<= ~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; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {16749#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16822#(<= |main_#t~post6| 3)} is VALID [2022-04-08 12:18:32,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {16822#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {16583#false} is VALID [2022-04-08 12:18:32,432 INFO L272 TraceCheckUtils]: 79: Hoare triple {16583#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16583#false} is VALID [2022-04-08 12:18:32,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {16583#false} ~cond := #in~cond; {16583#false} is VALID [2022-04-08 12:18:32,432 INFO L290 TraceCheckUtils]: 81: Hoare triple {16583#false} assume 0 == ~cond; {16583#false} is VALID [2022-04-08 12:18:32,432 INFO L290 TraceCheckUtils]: 82: Hoare triple {16583#false} assume !false; {16583#false} is VALID [2022-04-08 12:18:32,432 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-08 12:18:32,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:18:32,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {16583#false} assume !false; {16583#false} is VALID [2022-04-08 12:18:32,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {16583#false} assume 0 == ~cond; {16583#false} is VALID [2022-04-08 12:18:32,755 INFO L290 TraceCheckUtils]: 80: Hoare triple {16583#false} ~cond := #in~cond; {16583#false} is VALID [2022-04-08 12:18:32,755 INFO L272 TraceCheckUtils]: 79: Hoare triple {16583#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16583#false} is VALID [2022-04-08 12:18:32,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {16850#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {16583#false} is VALID [2022-04-08 12:18:32,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {16854#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16850#(< |main_#t~post6| 5)} is VALID [2022-04-08 12:18:32,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {16854#(< ~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; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {16854#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,757 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #92#return; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,757 INFO L290 TraceCheckUtils]: 73: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,757 INFO L290 TraceCheckUtils]: 71: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,757 INFO L272 TraceCheckUtils]: 70: Hoare triple {16854#(< ~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)); {16582#true} is VALID [2022-04-08 12:18:32,758 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #90#return; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,758 INFO L272 TraceCheckUtils]: 65: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,758 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #88#return; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,759 INFO L290 TraceCheckUtils]: 63: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,759 INFO L272 TraceCheckUtils]: 60: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,760 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #86#return; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,760 INFO L272 TraceCheckUtils]: 55: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {16854#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {16749#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16854#(< ~counter~0 5)} is VALID [2022-04-08 12:18:32,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {16749#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,762 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #92#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,763 INFO L272 TraceCheckUtils]: 47: Hoare triple {16749#(<= ~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)); {16582#true} is VALID [2022-04-08 12:18:32,763 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #90#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,763 INFO L272 TraceCheckUtils]: 42: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,764 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #88#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,764 INFO L272 TraceCheckUtils]: 37: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,765 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #86#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,765 INFO L272 TraceCheckUtils]: 32: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {16749#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {16679#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-08 12:18:32,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {16679#(<= ~counter~0 2)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {16679#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {16669#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16679#(<= ~counter~0 2)} is VALID [2022-04-08 12:18:32,768 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #84#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,768 INFO L272 TraceCheckUtils]: 22: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,768 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #82#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,769 INFO L272 TraceCheckUtils]: 17: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {16669#(<= ~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; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,769 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #80#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L272 TraceCheckUtils]: 11: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #78#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16582#true} is VALID [2022-04-08 12:18:32,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {16669#(<= ~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; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {16669#(<= ~counter~0 1)} call #t~ret8 := main(); {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16669#(<= ~counter~0 1)} {16582#true} #98#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {16669#(<= ~counter~0 1)} assume true; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {16582#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; {16669#(<= ~counter~0 1)} is VALID [2022-04-08 12:18:32,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {16582#true} call ULTIMATE.init(); {16582#true} is VALID [2022-04-08 12:18:32,772 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-08 12:18:32,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:18:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683097894] [2022-04-08 12:18:32,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:18:32,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110709017] [2022-04-08 12:18:32,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110709017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:18:32,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:18:32,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 12:18:32,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:18:32,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422135337] [2022-04-08 12:18:32,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422135337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:32,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:32,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:18:32,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574022662] [2022-04-08 12:18:32,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:18:32,773 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-08 12:18:32,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:18:32,774 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-08 12:18:32,821 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-08 12:18:32,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:18:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:32,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:18:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:18:32,822 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-08 12:18:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:33,327 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-08 12:18:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:18:33,327 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-08 12:18:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:18:33,327 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-08 12:18:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 12:18:33,328 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-08 12:18:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 12:18:33,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 12:18:33,405 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-08 12:18:33,408 INFO L225 Difference]: With dead ends: 214 [2022-04-08 12:18:33,408 INFO L226 Difference]: Without dead ends: 206 [2022-04-08 12:18:33,408 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-08 12:18:33,409 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:18:33,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 154 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:18:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-08 12:18:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-08 12:18:33,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:18:33,733 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-08 12:18:33,734 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-08 12:18:33,734 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-08 12:18:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:33,738 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-08 12:18:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-08 12:18:33,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:33,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:33,739 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-08 12:18:33,739 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-08 12:18:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:33,742 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-08 12:18:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-08 12:18:33,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:33,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:33,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:18:33,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:18:33,743 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-08 12:18:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-08 12:18:33,747 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-08 12:18:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:18:33,747 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-08 12:18:33,747 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-08 12:18:33,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-08 12:18:34,101 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-08 12:18:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-08 12:18:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 12:18:34,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:18:34,102 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-08 12:18:34,119 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-08 12:18:34,311 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-08 12:18:34,311 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:18:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:18:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-08 12:18:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:34,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684134717] [2022-04-08 12:18:34,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:18:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-08 12:18:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:18:34,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113067872] [2022-04-08 12:18:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:18:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:18:34,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:18:34,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967482894] [2022-04-08 12:18:34,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:18:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:18:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:18:34,322 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-08 12:18:34,323 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-08 12:18:34,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:18:34,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:18:34,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:18:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:18:34,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:18:34,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {18344#true} call ULTIMATE.init(); {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {18344#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; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18344#true} {18344#true} #98#return; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {18344#true} call #t~ret8 := main(); {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {18344#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; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {18344#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18344#true} {18344#true} #78#return; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L272 TraceCheckUtils]: 11: Hoare triple {18344#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,954 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18344#true} {18344#true} #80#return; {18344#true} is VALID [2022-04-08 12:18:34,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {18344#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; {18397#(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-08 12:18:34,956 INFO L272 TraceCheckUtils]: 17: Hoare triple {18397#(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)); {18344#true} is VALID [2022-04-08 12:18:34,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,957 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18344#true} {18397#(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; {18397#(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-08 12:18:34,957 INFO L272 TraceCheckUtils]: 22: Hoare triple {18397#(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)); {18344#true} is VALID [2022-04-08 12:18:34,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,960 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18344#true} {18397#(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; {18397#(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-08 12:18:34,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {18397#(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; {18397#(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-08 12:18:34,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {18397#(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; {18397#(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-08 12:18:34,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {18397#(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; {18437#(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-08 12:18:34,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {18437#(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; {18437#(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-08 12:18:34,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {18437#(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; {18437#(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-08 12:18:34,962 INFO L272 TraceCheckUtils]: 32: Hoare triple {18437#(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)); {18344#true} is VALID [2022-04-08 12:18:34,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,963 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18344#true} {18437#(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; {18437#(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-08 12:18:34,963 INFO L272 TraceCheckUtils]: 37: Hoare triple {18437#(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)); {18344#true} is VALID [2022-04-08 12:18:34,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,964 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18344#true} {18437#(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; {18437#(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-08 12:18:34,964 INFO L272 TraceCheckUtils]: 42: Hoare triple {18437#(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)); {18344#true} is VALID [2022-04-08 12:18:34,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,965 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18344#true} {18437#(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; {18437#(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-08 12:18:34,965 INFO L272 TraceCheckUtils]: 47: Hoare triple {18437#(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)); {18344#true} is VALID [2022-04-08 12:18:34,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,965 INFO L290 TraceCheckUtils]: 50: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,966 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18344#true} {18437#(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; {18437#(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-08 12:18:34,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {18437#(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; {18507#(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-08 12:18:34,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {18507#(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; {18507#(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-08 12:18:34,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {18507#(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; {18507#(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-08 12:18:34,967 INFO L272 TraceCheckUtils]: 55: Hoare triple {18507#(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)); {18344#true} is VALID [2022-04-08 12:18:34,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,968 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18344#true} {18507#(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; {18507#(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-08 12:18:34,968 INFO L272 TraceCheckUtils]: 60: Hoare triple {18507#(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)); {18344#true} is VALID [2022-04-08 12:18:34,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,969 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18344#true} {18507#(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; {18507#(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-08 12:18:34,969 INFO L272 TraceCheckUtils]: 65: Hoare triple {18507#(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)); {18344#true} is VALID [2022-04-08 12:18:34,969 INFO L290 TraceCheckUtils]: 66: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,970 INFO L290 TraceCheckUtils]: 67: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,970 INFO L290 TraceCheckUtils]: 68: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,970 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18344#true} {18507#(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; {18507#(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-08 12:18:34,970 INFO L272 TraceCheckUtils]: 70: Hoare triple {18507#(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)); {18344#true} is VALID [2022-04-08 12:18:34,971 INFO L290 TraceCheckUtils]: 71: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:34,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:34,971 INFO L290 TraceCheckUtils]: 73: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:34,971 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18344#true} {18507#(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; {18507#(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-08 12:18:34,972 INFO L290 TraceCheckUtils]: 75: Hoare triple {18507#(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); {18507#(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-08 12:18:34,972 INFO L290 TraceCheckUtils]: 76: Hoare triple {18507#(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; {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 12:18:34,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {18580#(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; {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 12:18:34,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {18580#(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; {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 12:18:34,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 12:18:34,974 INFO L272 TraceCheckUtils]: 80: Hoare triple {18590#(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)); {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:18:34,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:34,974 INFO L290 TraceCheckUtils]: 82: Hoare triple {18598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18345#false} is VALID [2022-04-08 12:18:34,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {18345#false} assume !false; {18345#false} is VALID [2022-04-08 12:18:34,975 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-08 12:18:34,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:18:35,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {18345#false} assume !false; {18345#false} is VALID [2022-04-08 12:18:35,453 INFO L290 TraceCheckUtils]: 82: Hoare triple {18598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18345#false} is VALID [2022-04-08 12:18:35,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:35,454 INFO L272 TraceCheckUtils]: 80: Hoare triple {18614#(= (+ (* 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)); {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:18:35,454 INFO L290 TraceCheckUtils]: 79: Hoare triple {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {18614#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-08 12:18:35,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {18618#(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; {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 12:18:35,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {18618#(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; {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 12:18:35,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {18628#(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; {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 12:18:35,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {18628#(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); {18628#(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-08 12:18:35,598 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18344#true} {18628#(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; {18628#(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-08 12:18:35,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,598 INFO L272 TraceCheckUtils]: 70: Hoare triple {18628#(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)); {18344#true} is VALID [2022-04-08 12:18:35,599 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18344#true} {18628#(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; {18628#(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-08 12:18:35,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,599 INFO L272 TraceCheckUtils]: 65: Hoare triple {18628#(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)); {18344#true} is VALID [2022-04-08 12:18:35,600 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18344#true} {18628#(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; {18628#(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-08 12:18:35,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,600 INFO L272 TraceCheckUtils]: 60: Hoare triple {18628#(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)); {18344#true} is VALID [2022-04-08 12:18:35,601 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18344#true} {18628#(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; {18628#(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-08 12:18:35,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,601 INFO L272 TraceCheckUtils]: 55: Hoare triple {18628#(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)); {18344#true} is VALID [2022-04-08 12:18:35,601 INFO L290 TraceCheckUtils]: 54: Hoare triple {18628#(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; {18628#(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-08 12:18:35,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {18628#(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; {18628#(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-08 12:18:35,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(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; {18628#(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-08 12:18:35,981 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18344#true} {18701#(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; {18701#(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-08 12:18:35,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,981 INFO L272 TraceCheckUtils]: 47: Hoare triple {18701#(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)); {18344#true} is VALID [2022-04-08 12:18:35,982 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18344#true} {18701#(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; {18701#(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-08 12:18:35,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,982 INFO L272 TraceCheckUtils]: 42: Hoare triple {18701#(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)); {18344#true} is VALID [2022-04-08 12:18:35,983 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18344#true} {18701#(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; {18701#(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-08 12:18:35,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,983 INFO L272 TraceCheckUtils]: 37: Hoare triple {18701#(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)); {18344#true} is VALID [2022-04-08 12:18:35,984 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18344#true} {18701#(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; {18701#(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-08 12:18:35,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,984 INFO L272 TraceCheckUtils]: 32: Hoare triple {18701#(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)); {18344#true} is VALID [2022-04-08 12:18:35,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {18701#(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; {18701#(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-08 12:18:35,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {18701#(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; {18701#(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-08 12:18:35,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {18771#(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; {18701#(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-08 12:18:35,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {18771#(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; {18771#(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-08 12:18:35,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {18771#(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; {18771#(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-08 12:18:35,987 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18344#true} {18771#(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; {18771#(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-08 12:18:35,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,987 INFO L272 TraceCheckUtils]: 22: Hoare triple {18771#(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)); {18344#true} is VALID [2022-04-08 12:18:35,988 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18344#true} {18771#(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; {18771#(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-08 12:18:35,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,988 INFO L272 TraceCheckUtils]: 17: Hoare triple {18771#(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)); {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {18344#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; {18771#(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-08 12:18:35,989 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18344#true} {18344#true} #80#return; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L272 TraceCheckUtils]: 11: Hoare triple {18344#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18344#true} {18344#true} #78#return; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L272 TraceCheckUtils]: 6: Hoare triple {18344#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {18344#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; {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {18344#true} call #t~ret8 := main(); {18344#true} is VALID [2022-04-08 12:18:35,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18344#true} {18344#true} #98#return; {18344#true} is VALID [2022-04-08 12:18:35,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-08 12:18:35,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {18344#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; {18344#true} is VALID [2022-04-08 12:18:35,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {18344#true} call ULTIMATE.init(); {18344#true} is VALID [2022-04-08 12:18:35,990 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-08 12:18:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:18:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113067872] [2022-04-08 12:18:35,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:18:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967482894] [2022-04-08 12:18:35,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967482894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:18:35,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:18:35,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 12:18:35,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:18:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684134717] [2022-04-08 12:18:35,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684134717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:35,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:35,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:18:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828324737] [2022-04-08 12:18:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:18:35,991 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-08 12:18:35,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:18:35,992 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-08 12:18:36,041 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-08 12:18:36,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:18:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:36,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:18:36,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:18:36,042 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-08 12:18:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:37,400 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-08 12:18:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:18:37,400 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-08 12:18:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:18:37,400 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-08 12:18:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 12:18:37,402 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-08 12:18:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 12:18:37,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-08 12:18:37,513 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-08 12:18:37,517 INFO L225 Difference]: With dead ends: 234 [2022-04-08 12:18:37,517 INFO L226 Difference]: Without dead ends: 232 [2022-04-08 12:18:37,517 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-08 12:18:37,518 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-08 12:18:37,518 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-08 12:18:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-08 12:18:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-08 12:18:37,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:18:37,971 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-08 12:18:37,972 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-08 12:18:37,972 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-08 12:18:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:37,978 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-08 12:18:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-08 12:18:37,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:37,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:37,979 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-08 12:18:37,979 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-08 12:18:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:37,986 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-08 12:18:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-08 12:18:37,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:37,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:37,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:18:37,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:18:37,989 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-08 12:18:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-08 12:18:37,994 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-08 12:18:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:18:37,994 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-08 12:18:37,994 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-08 12:18:37,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-08 12:18:38,366 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-08 12:18:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-08 12:18:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 12:18:38,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:18:38,367 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-08 12:18:38,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 12:18:38,597 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-08 12:18:38,597 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:18:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:18:38,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-08 12:18:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:38,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [47203911] [2022-04-08 12:18:38,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:18:38,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-08 12:18:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:18:38,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392658873] [2022-04-08 12:18:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:18:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:18:38,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:18:38,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222848539] [2022-04-08 12:18:38,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:18:38,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:18:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:18:38,615 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-08 12:18:38,619 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-08 12:18:38,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:18:38,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:18:38,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:18:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:18:38,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:18:38,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {20259#true} call ULTIMATE.init(); {20259#true} is VALID [2022-04-08 12:18:38,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {20259#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; {20259#true} is VALID [2022-04-08 12:18:38,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20259#true} {20259#true} #98#return; {20259#true} is VALID [2022-04-08 12:18:38,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {20259#true} call #t~ret8 := main(); {20259#true} is VALID [2022-04-08 12:18:38,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {20259#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; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {20259#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20259#true} {20259#true} #78#return; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L272 TraceCheckUtils]: 11: Hoare triple {20259#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20259#true} {20259#true} #80#return; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {20259#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; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L272 TraceCheckUtils]: 17: Hoare triple {20259#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20259#true} {20259#true} #82#return; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L272 TraceCheckUtils]: 22: Hoare triple {20259#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20259#true} {20259#true} #84#return; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {20259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {20259#true} assume !!(#t~post6 < 5);havoc #t~post6; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {20259#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {20259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {20259#true} assume !!(#t~post7 < 5);havoc #t~post7; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L272 TraceCheckUtils]: 32: Hoare triple {20259#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20259#true} {20259#true} #86#return; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L272 TraceCheckUtils]: 37: Hoare triple {20259#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20259#true} {20259#true} #88#return; {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L272 TraceCheckUtils]: 42: Hoare triple {20259#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20259#true} {20259#true} #90#return; {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L272 TraceCheckUtils]: 47: Hoare triple {20259#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)); {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20259#true} {20259#true} #92#return; {20259#true} is VALID [2022-04-08 12:18:38,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {20259#true} assume !(~c~0 >= ~b~0); {20420#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 12:18:38,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {20420#(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; {20424#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 12:18:38,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {20424#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20424#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 12:18:38,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {20424#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {20424#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 12:18:38,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {20424#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {20434#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {20434#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,872 INFO L272 TraceCheckUtils]: 59: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,872 INFO L290 TraceCheckUtils]: 62: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #86#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,873 INFO L272 TraceCheckUtils]: 64: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #88#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,873 INFO L272 TraceCheckUtils]: 69: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,874 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #90#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,874 INFO L272 TraceCheckUtils]: 74: Hoare triple {20434#(< 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)); {20259#true} is VALID [2022-04-08 12:18:38,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-08 12:18:38,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-08 12:18:38,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-08 12:18:38,875 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #92#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 12:18:38,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {20434#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {20260#false} is VALID [2022-04-08 12:18:38,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {20260#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; {20260#false} is VALID [2022-04-08 12:18:38,875 INFO L290 TraceCheckUtils]: 81: Hoare triple {20260#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20260#false} is VALID [2022-04-08 12:18:38,875 INFO L290 TraceCheckUtils]: 82: Hoare triple {20260#false} assume !(#t~post6 < 5);havoc #t~post6; {20260#false} is VALID [2022-04-08 12:18:38,875 INFO L272 TraceCheckUtils]: 83: Hoare triple {20260#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {20260#false} is VALID [2022-04-08 12:18:38,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {20260#false} ~cond := #in~cond; {20260#false} is VALID [2022-04-08 12:18:38,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {20260#false} assume 0 == ~cond; {20260#false} is VALID [2022-04-08 12:18:38,876 INFO L290 TraceCheckUtils]: 86: Hoare triple {20260#false} assume !false; {20260#false} is VALID [2022-04-08 12:18:38,876 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-08 12:18:38,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:18:38,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:18:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392658873] [2022-04-08 12:18:38,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:18:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222848539] [2022-04-08 12:18:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222848539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:38,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:18:38,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:18:38,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [47203911] [2022-04-08 12:18:38,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [47203911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:38,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:38,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:18:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462251347] [2022-04-08 12:18:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:18:38,877 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-08 12:18:38,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:18:38,877 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-08 12:18:38,916 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-08 12:18:38,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:18:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:18:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:18:38,916 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-08 12:18:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:39,667 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-08 12:18:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:18:39,667 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-08 12:18:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:18:39,668 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-08 12:18:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-08 12:18:39,669 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-08 12:18:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-08 12:18:39,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-08 12:18:39,749 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-08 12:18:39,754 INFO L225 Difference]: With dead ends: 371 [2022-04-08 12:18:39,754 INFO L226 Difference]: Without dead ends: 291 [2022-04-08 12:18:39,755 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-08 12:18:39,756 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-08 12:18:39,756 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-08 12:18:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-08 12:18:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-08 12:18:40,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:18:40,186 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-08 12:18:40,186 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-08 12:18:40,187 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-08 12:18:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:40,193 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-08 12:18:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-08 12:18:40,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:40,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:40,194 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-08 12:18:40,194 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-08 12:18:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:18:40,200 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-08 12:18:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-08 12:18:40,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:18:40,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:18:40,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:18:40,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:18:40,201 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-08 12:18:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-08 12:18:40,206 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-08 12:18:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:18:40,207 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-08 12:18:40,207 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-08 12:18:40,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-08 12:18:40,632 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-08 12:18:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-08 12:18:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 12:18:40,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:18:40,635 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-08 12:18:40,653 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-08 12:18:40,851 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-08 12:18:40,852 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:18:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:18:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-08 12:18:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:40,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579058850] [2022-04-08 12:18:40,852 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:18:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-08 12:18:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:18:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042008089] [2022-04-08 12:18:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:18:40,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:18:40,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:18:40,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36636921] [2022-04-08 12:18:40,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:18:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:18:40,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:18:40,863 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-08 12:18:40,864 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-08 12:18:40,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:18:40,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:18:40,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 12:18:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:18:40,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:18:41,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {22367#true} call ULTIMATE.init(); {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {22367#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; {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22367#true} {22367#true} #98#return; {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {22367#true} call #t~ret8 := main(); {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {22367#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; {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {22367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22367#true} {22367#true} #78#return; {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L272 TraceCheckUtils]: 11: Hoare triple {22367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22367#true} {22367#true} #80#return; {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {22367#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; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {22420#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,145 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #82#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,145 INFO L272 TraceCheckUtils]: 22: Hoare triple {22420#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,145 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #84#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {22420#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {22420#(= main_~q~0 0)} assume !!(#t~post6 < 5);havoc #t~post6; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {22420#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {22420#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {22420#(= main_~q~0 0)} assume !!(#t~post7 < 5);havoc #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,147 INFO L272 TraceCheckUtils]: 32: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,150 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #86#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,150 INFO L272 TraceCheckUtils]: 37: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,151 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #88#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,151 INFO L272 TraceCheckUtils]: 42: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,152 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #90#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,152 INFO L272 TraceCheckUtils]: 47: Hoare triple {22420#(= 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)); {22367#true} is VALID [2022-04-08 12:18:41,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,152 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #92#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,153 INFO L290 TraceCheckUtils]: 52: Hoare triple {22420#(= main_~q~0 0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {22420#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {22420#(= main_~q~0 0)} assume !!(#t~post7 < 5);havoc #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,153 INFO L272 TraceCheckUtils]: 55: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,154 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #86#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,154 INFO L272 TraceCheckUtils]: 60: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,154 INFO L290 TraceCheckUtils]: 63: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,154 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #88#return; {22420#(= main_~q~0 0)} is VALID [2022-04-08 12:18:41,154 INFO L272 TraceCheckUtils]: 65: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:41,155 INFO L290 TraceCheckUtils]: 66: Hoare triple {22367#true} ~cond := #in~cond; {22571#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:41,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {22571#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:18:41,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:18:41,156 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} {22420#(= main_~q~0 0)} #90#return; {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 12:18:41,156 INFO L272 TraceCheckUtils]: 70: Hoare triple {22582#(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)); {22367#true} is VALID [2022-04-08 12:18:41,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,157 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22367#true} {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #92#return; {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 12:18:41,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {22582#(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); {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 12:18:41,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {22582#(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; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 12:18:41,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 12:18:41,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !!(#t~post6 < 5);havoc #t~post6; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 12:18:41,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !(0 != ~b~0); {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 12:18:41,158 INFO L272 TraceCheckUtils]: 80: Hoare triple {22604#(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)); {22367#true} is VALID [2022-04-08 12:18:41,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:41,159 INFO L290 TraceCheckUtils]: 82: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:41,159 INFO L290 TraceCheckUtils]: 83: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:41,159 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22367#true} {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #94#return; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 12:18:41,160 INFO L272 TraceCheckUtils]: 85: Hoare triple {22604#(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)); {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:18:41,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:41,160 INFO L290 TraceCheckUtils]: 87: Hoare triple {22636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22368#false} is VALID [2022-04-08 12:18:41,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {22368#false} assume !false; {22368#false} is VALID [2022-04-08 12:18:41,161 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-08 12:18:41,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:18:59,482 INFO L290 TraceCheckUtils]: 88: Hoare triple {22368#false} assume !false; {22368#false} is VALID [2022-04-08 12:18:59,482 INFO L290 TraceCheckUtils]: 87: Hoare triple {22636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22368#false} is VALID [2022-04-08 12:18:59,483 INFO L290 TraceCheckUtils]: 86: Hoare triple {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:18:59,483 INFO L272 TraceCheckUtils]: 85: Hoare triple {22652#(= 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)); {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:18:59,484 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22367#true} {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #94#return; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:18:59,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,484 INFO L272 TraceCheckUtils]: 80: Hoare triple {22652#(= 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)); {22367#true} is VALID [2022-04-08 12:18:59,484 INFO L290 TraceCheckUtils]: 79: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:18:59,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:18:59,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:18:59,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {22680#(= 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; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 12:18:59,486 INFO L290 TraceCheckUtils]: 75: Hoare triple {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:18:59,486 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22367#true} {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:18:59,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,486 INFO L272 TraceCheckUtils]: 70: Hoare triple {22680#(= 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)); {22367#true} is VALID [2022-04-08 12:18:59,487 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} {22367#true} #90#return; {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 12:18:59,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 67: Hoare triple {22711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 66: Hoare triple {22367#true} ~cond := #in~cond; {22711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:18:59,488 INFO L272 TraceCheckUtils]: 65: Hoare triple {22367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22367#true} {22367#true} #88#return; {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L272 TraceCheckUtils]: 60: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22367#true} {22367#true} #86#return; {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L272 TraceCheckUtils]: 55: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {22367#true} assume !!(#t~post7 < 5);havoc #t~post7; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {22367#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {22367#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22367#true} {22367#true} #92#return; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L272 TraceCheckUtils]: 47: Hoare triple {22367#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)); {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22367#true} {22367#true} #90#return; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L272 TraceCheckUtils]: 42: Hoare triple {22367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22367#true} {22367#true} #88#return; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L272 TraceCheckUtils]: 37: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22367#true} {22367#true} #86#return; {22367#true} is VALID [2022-04-08 12:18:59,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L272 TraceCheckUtils]: 32: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {22367#true} assume !!(#t~post7 < 5);havoc #t~post7; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {22367#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {22367#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {22367#true} assume !!(#t~post6 < 5);havoc #t~post6; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {22367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22367#true} {22367#true} #84#return; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L272 TraceCheckUtils]: 22: Hoare triple {22367#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22367#true} {22367#true} #82#return; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L272 TraceCheckUtils]: 17: Hoare triple {22367#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {22367#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; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22367#true} {22367#true} #80#return; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L272 TraceCheckUtils]: 11: Hoare triple {22367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22367#true} {22367#true} #78#return; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {22367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {22367#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; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {22367#true} call #t~ret8 := main(); {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22367#true} {22367#true} #98#return; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {22367#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; {22367#true} is VALID [2022-04-08 12:18:59,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {22367#true} call ULTIMATE.init(); {22367#true} is VALID [2022-04-08 12:18:59,492 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-08 12:18:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:18:59,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042008089] [2022-04-08 12:18:59,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:18:59,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36636921] [2022-04-08 12:18:59,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36636921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:18:59,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:18:59,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-08 12:18:59,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:18:59,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579058850] [2022-04-08 12:18:59,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579058850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:18:59,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:18:59,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:18:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325272461] [2022-04-08 12:18:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:18:59,493 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-08 12:18:59,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:18:59,493 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-08 12:18:59,529 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-08 12:18:59,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:18:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:18:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:18:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:18:59,529 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-08 12:19:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:19:00,559 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-08 12:19:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:19:00,559 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-08 12:19:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:19:00,559 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-08 12:19:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-08 12:19:00,560 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-08 12:19:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-08 12:19:00,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-08 12:19:00,810 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-08 12:19:00,815 INFO L225 Difference]: With dead ends: 301 [2022-04-08 12:19:00,815 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 12:19:00,815 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-08 12:19:00,816 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:19:00,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 237 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:19:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 12:19:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-08 12:19:01,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:19:01,305 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-08 12:19:01,306 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-08 12:19:01,306 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-08 12:19:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:19:01,312 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-08 12:19:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-08 12:19:01,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:19:01,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:19:01,313 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-08 12:19:01,314 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-08 12:19:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:19:01,319 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-08 12:19:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-08 12:19:01,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:19:01,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:19:01,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:19:01,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:19:01,320 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-08 12:19:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-08 12:19:01,327 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-08 12:19:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:19:01,327 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-08 12:19:01,327 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-08 12:19:01,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-08 12:19:01,855 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-08 12:19:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-08 12:19:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 12:19:01,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:19:01,856 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-08 12:19:01,875 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-08 12:19:02,071 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-08 12:19:02,071 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:19:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:19:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-08 12:19:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:19:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52209880] [2022-04-08 12:19:02,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:19:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-08 12:19:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:19:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736755230] [2022-04-08 12:19:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:19:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:19:02,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:19:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963818094] [2022-04-08 12:19:02,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:19:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:19:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:19:02,082 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-08 12:19:02,083 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-08 12:19:02,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:19:02,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:19:02,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:19:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:19:02,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:19:02,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {24698#true} call ULTIMATE.init(); {24698#true} is VALID [2022-04-08 12:19:02,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {24698#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; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24706#(<= ~counter~0 0)} {24698#true} #98#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {24706#(<= ~counter~0 0)} call #t~ret8 := main(); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {24706#(<= ~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; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #78#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #80#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {24706#(<= ~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; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,460 INFO L272 TraceCheckUtils]: 17: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,461 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #82#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,461 INFO L272 TraceCheckUtils]: 22: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,462 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #84#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {24706#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-08 12:19:02,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {24785#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-08 12:19:02,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {24785#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24785#(<= ~counter~0 1)} is VALID [2022-04-08 12:19:02,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {24785#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {24795#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,465 INFO L272 TraceCheckUtils]: 32: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,466 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #86#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,466 INFO L272 TraceCheckUtils]: 37: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,468 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #88#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,468 INFO L272 TraceCheckUtils]: 42: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,469 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #90#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,470 INFO L272 TraceCheckUtils]: 47: Hoare triple {24795#(<= ~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)); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,471 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #92#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {24795#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {24795#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {24865#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,472 INFO L272 TraceCheckUtils]: 55: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,474 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #86#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,474 INFO L272 TraceCheckUtils]: 60: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,474 INFO L290 TraceCheckUtils]: 61: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,475 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #88#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,476 INFO L272 TraceCheckUtils]: 65: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,477 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #90#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,478 INFO L272 TraceCheckUtils]: 70: Hoare triple {24865#(<= ~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)); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,479 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #92#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {24865#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {24865#(<= ~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; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {24865#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-08 12:19:02,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {24938#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-08 12:19:02,480 INFO L290 TraceCheckUtils]: 79: Hoare triple {24938#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24938#(<= ~counter~0 4)} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {24938#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24948#(<= |main_#t~post7| 4)} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {24948#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 82: Hoare triple {24699#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; {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 83: Hoare triple {24699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 84: Hoare triple {24699#false} assume !(#t~post6 < 5);havoc #t~post6; {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L272 TraceCheckUtils]: 85: Hoare triple {24699#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 86: Hoare triple {24699#false} ~cond := #in~cond; {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 87: Hoare triple {24699#false} assume 0 == ~cond; {24699#false} is VALID [2022-04-08 12:19:02,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {24699#false} assume !false; {24699#false} is VALID [2022-04-08 12:19:02,482 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-08 12:19:02,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:19:02,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {24699#false} assume !false; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 87: Hoare triple {24699#false} assume 0 == ~cond; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {24699#false} ~cond := #in~cond; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L272 TraceCheckUtils]: 85: Hoare triple {24699#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 84: Hoare triple {24699#false} assume !(#t~post6 < 5);havoc #t~post6; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 83: Hoare triple {24699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 82: Hoare triple {24699#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; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {24948#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {24699#false} is VALID [2022-04-08 12:19:02,765 INFO L290 TraceCheckUtils]: 80: Hoare triple {24938#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24948#(<= |main_#t~post7| 4)} is VALID [2022-04-08 12:19:02,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {24938#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24938#(<= ~counter~0 4)} is VALID [2022-04-08 12:19:02,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {24938#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-08 12:19:02,767 INFO L290 TraceCheckUtils]: 77: Hoare triple {24865#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-08 12:19:02,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {24865#(<= ~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; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {24865#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,768 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #92#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,768 INFO L290 TraceCheckUtils]: 71: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,768 INFO L272 TraceCheckUtils]: 70: Hoare triple {24865#(<= ~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)); {24698#true} is VALID [2022-04-08 12:19:02,768 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #90#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L272 TraceCheckUtils]: 65: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #88#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,769 INFO L272 TraceCheckUtils]: 60: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,770 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #86#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,770 INFO L272 TraceCheckUtils]: 55: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {24865#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {24795#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-08 12:19:02,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {24795#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,772 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #92#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,772 INFO L272 TraceCheckUtils]: 47: Hoare triple {24795#(<= ~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)); {24698#true} is VALID [2022-04-08 12:19:02,772 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #90#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,773 INFO L272 TraceCheckUtils]: 42: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,773 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #88#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,773 INFO L272 TraceCheckUtils]: 37: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,774 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #86#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,774 INFO L272 TraceCheckUtils]: 32: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {24795#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {24785#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-08 12:19:02,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {24785#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24785#(<= ~counter~0 1)} is VALID [2022-04-08 12:19:02,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {24785#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-08 12:19:02,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {24706#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-08 12:19:02,776 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #84#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,776 INFO L272 TraceCheckUtils]: 22: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,783 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #82#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,783 INFO L272 TraceCheckUtils]: 17: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {24706#(<= ~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; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #80#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L272 TraceCheckUtils]: 11: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #78#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-08 12:19:02,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24698#true} is VALID [2022-04-08 12:19:02,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {24706#(<= ~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; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {24706#(<= ~counter~0 0)} call #t~ret8 := main(); {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24706#(<= ~counter~0 0)} {24698#true} #98#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {24698#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; {24706#(<= ~counter~0 0)} is VALID [2022-04-08 12:19:02,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {24698#true} call ULTIMATE.init(); {24698#true} is VALID [2022-04-08 12:19:02,786 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-08 12:19:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:19:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736755230] [2022-04-08 12:19:02,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:19:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963818094] [2022-04-08 12:19:02,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963818094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:19:02,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:19:02,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-08 12:19:02,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:19:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52209880] [2022-04-08 12:19:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52209880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:19:02,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:19:02,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:19:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447112242] [2022-04-08 12:19:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:19:02,787 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-08 12:19:02,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:19:02,787 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-08 12:19:02,830 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-08 12:19:02,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:19:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:19:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:19:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:19:02,831 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-08 12:19:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:19:03,666 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-08 12:19:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:19:03,666 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-08 12:19:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:19:03,667 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-08 12:19:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-08 12:19:03,668 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-08 12:19:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-08 12:19:03,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-08 12:19:03,760 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-08 12:19:03,766 INFO L225 Difference]: With dead ends: 463 [2022-04-08 12:19:03,766 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 12:19:03,766 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-08 12:19:03,767 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:19:03,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 162 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:19:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 12:19:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-08 12:19:04,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:19:04,307 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-08 12:19:04,318 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-08 12:19:04,318 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-08 12:19:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:19:04,324 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-08 12:19:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-08 12:19:04,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:19:04,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:19:04,325 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-08 12:19:04,325 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-08 12:19:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:19:04,331 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-08 12:19:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-08 12:19:04,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:19:04,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:19:04,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:19:04,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:19:04,333 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-08 12:19:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-08 12:19:04,341 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-08 12:19:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:19:04,341 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-08 12:19:04,341 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-08 12:19:04,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-08 12:19:04,905 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-08 12:19:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-08 12:19:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 12:19:04,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:19:04,906 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-08 12:19:04,923 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-08 12:19:05,106 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-08 12:19:05,106 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:19:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:19:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-08 12:19:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:19:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920114397] [2022-04-08 12:19:05,107 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:19:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-08 12:19:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:19:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829329736] [2022-04-08 12:19:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:19:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:19:05,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:19:05,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347680762] [2022-04-08 12:19:05,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:19:05,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:19:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:19:05,122 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-08 12:19:05,123 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-08 12:19:05,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:19:05,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:19:05,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 12:19:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:19:05,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:19:09,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {27483#true} call ULTIMATE.init(); {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {27483#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; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27483#true} {27483#true} #98#return; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {27483#true} call #t~ret8 := main(); {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {27483#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; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {27483#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27483#true} {27483#true} #78#return; {27483#true} is VALID [2022-04-08 12:19:09,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {27483#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27483#true} is VALID [2022-04-08 12:19:09,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {27483#true} ~cond := #in~cond; {27524#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 12:19:09,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {27524#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27528#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:19:09,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {27528#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27528#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 12:19:09,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27528#(not (= |assume_abort_if_not_#in~cond| 0))} {27483#true} #80#return; {27535#(<= 1 main_~y~0)} is VALID [2022-04-08 12:19:09,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {27535#(<= 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; {27539#(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-08 12:19:09,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {27539#(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)); {27483#true} is VALID [2022-04-08 12:19:09,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,803 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27483#true} {27539#(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; {27539#(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-08 12:19:09,803 INFO L272 TraceCheckUtils]: 22: Hoare triple {27539#(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)); {27483#true} is VALID [2022-04-08 12:19:09,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,804 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27483#true} {27539#(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; {27539#(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-08 12:19:09,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {27539#(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; {27539#(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-08 12:19:09,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {27539#(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; {27539#(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-08 12:19:09,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {27539#(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; {27579#(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-08 12:19:09,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {27579#(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; {27579#(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-08 12:19:09,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {27579#(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; {27579#(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-08 12:19:09,806 INFO L272 TraceCheckUtils]: 32: Hoare triple {27579#(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)); {27483#true} is VALID [2022-04-08 12:19:09,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,807 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27483#true} {27579#(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; {27579#(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-08 12:19:09,807 INFO L272 TraceCheckUtils]: 37: Hoare triple {27579#(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)); {27483#true} is VALID [2022-04-08 12:19:09,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,808 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27483#true} {27579#(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; {27579#(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-08 12:19:09,808 INFO L272 TraceCheckUtils]: 42: Hoare triple {27579#(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)); {27483#true} is VALID [2022-04-08 12:19:09,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,809 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27483#true} {27579#(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; {27579#(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-08 12:19:09,809 INFO L272 TraceCheckUtils]: 47: Hoare triple {27579#(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)); {27483#true} is VALID [2022-04-08 12:19:09,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,810 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {27483#true} {27579#(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; {27579#(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-08 12:19:09,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {27579#(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; {27649#(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-08 12:19:09,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {27649#(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; {27649#(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-08 12:19:09,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {27649#(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; {27649#(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-08 12:19:09,813 INFO L272 TraceCheckUtils]: 55: Hoare triple {27649#(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)); {27483#true} is VALID [2022-04-08 12:19:09,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:19:09,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,815 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27649#(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; {27673#(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-08 12:19:09,815 INFO L272 TraceCheckUtils]: 60: Hoare triple {27673#(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)); {27483#true} is VALID [2022-04-08 12:19:09,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,816 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27483#true} {27673#(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; {27673#(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-08 12:19:09,816 INFO L272 TraceCheckUtils]: 65: Hoare triple {27673#(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)); {27483#true} is VALID [2022-04-08 12:19:09,817 INFO L290 TraceCheckUtils]: 66: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:19:09,817 INFO L290 TraceCheckUtils]: 67: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,818 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27673#(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; {27673#(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-08 12:19:09,818 INFO L272 TraceCheckUtils]: 70: Hoare triple {27673#(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)); {27483#true} is VALID [2022-04-08 12:19:09,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:19:09,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,819 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27673#(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; {27673#(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-08 12:19:09,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {27673#(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); {27722#(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-08 12:19:09,821 INFO L290 TraceCheckUtils]: 76: Hoare triple {27722#(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; {27726#(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-08 12:19:09,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {27726#(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; {27726#(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-08 12:19:09,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {27726#(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; {27726#(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-08 12:19:09,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {27726#(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; {27726#(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-08 12:19:09,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {27726#(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; {27726#(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-08 12:19:09,824 INFO L290 TraceCheckUtils]: 81: Hoare triple {27726#(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; {27726#(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-08 12:19:09,824 INFO L272 TraceCheckUtils]: 82: Hoare triple {27726#(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)); {27483#true} is VALID [2022-04-08 12:19:09,824 INFO L290 TraceCheckUtils]: 83: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,825 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27483#true} {27726#(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; {27726#(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-08 12:19:09,825 INFO L272 TraceCheckUtils]: 87: Hoare triple {27726#(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)); {27483#true} is VALID [2022-04-08 12:19:09,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-08 12:19:09,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-08 12:19:09,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-08 12:19:09,826 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27483#true} {27726#(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; {27726#(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-08 12:19:09,826 INFO L272 TraceCheckUtils]: 92: Hoare triple {27726#(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)); {27483#true} is VALID [2022-04-08 12:19:09,826 INFO L290 TraceCheckUtils]: 93: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:19:09,826 INFO L290 TraceCheckUtils]: 94: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,827 INFO L290 TraceCheckUtils]: 95: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:19:09,828 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27726#(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; {27787#(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-08 12:19:09,830 INFO L272 TraceCheckUtils]: 97: Hoare triple {27787#(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)); {27791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:19:09,831 INFO L290 TraceCheckUtils]: 98: Hoare triple {27791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:19:09,831 INFO L290 TraceCheckUtils]: 99: Hoare triple {27795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27484#false} is VALID [2022-04-08 12:19:09,831 INFO L290 TraceCheckUtils]: 100: Hoare triple {27484#false} assume !false; {27484#false} is VALID [2022-04-08 12:19:09,832 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-08 12:19:09,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:19:52,254 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:20:36,301 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_main_~x~0 0)) (.cse3 (+ (* c_main_~q~0 c_main_~x~0 c_main_~k~0) c_main_~c~0 (* (- 1) c_main_~r~0 c_main_~y~0) (* c_main_~s~0 c_main_~y~0 c_main_~k~0)))) (and (or .cse0 (let ((.cse2 (+ c_main_~r~0 (* (- 1) (* c_main_~s~0 c_main_~k~0)))) (.cse1 (+ (div .cse3 c_main_~x~0) (* (- 1) c_main_~q~0 c_main_~k~0)))) (= (+ (* .cse1 c_main_~x~0) (* .cse2 c_main_~y~0) (* c_main_~c~0 c_main_~y~0)) (+ c_main_~c~0 (* c_main_~yy~0 .cse2) (* c_main_~xy~0 .cse1)))) (not (= (mod .cse3 c_main_~x~0) 0))) (or (forall ((main_~p~0 Int)) (let ((.cse5 (+ c_main_~r~0 (* (- 1) (* c_main_~s~0 c_main_~k~0)))) (.cse4 (+ main_~p~0 (* (- 1) c_main_~q~0 c_main_~k~0)))) (= (+ c_main_~c~0 (* c_main_~xy~0 .cse4) (* c_main_~yy~0 .cse5)) (+ (* .cse5 c_main_~y~0) (* .cse4 c_main_~x~0) (* c_main_~c~0 c_main_~y~0))))) (not .cse0) (not (= .cse3 0))))) (not (= (+ (* c_main_~q~0 c_main_~x~0) (* c_main_~s~0 c_main_~y~0) (* c_main_~b~0 c_main_~y~0)) (+ (* c_main_~q~0 c_main_~xy~0) (* c_main_~yy~0 c_main_~s~0) c_main_~b~0))) (<= c_main_~b~0 c_main_~c~0)) is different from true [2022-04-08 12:20:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:20:36,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829329736] [2022-04-08 12:20:36,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:20:36,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347680762] [2022-04-08 12:20:36,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347680762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:20:36,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:20:36,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 12:20:36,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:20:36,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920114397] [2022-04-08 12:20:36,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920114397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:20:36,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:20:36,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:20:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678557908] [2022-04-08 12:20:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:20:36,304 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-08 12:20:36,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:20:36,304 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-08 12:20:36,393 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-08 12:20:36,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:20:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:20:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:20:36,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=339, Unknown=2, NotChecked=38, Total=462 [2022-04-08 12:20:36,394 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-08 12:20:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:20:49,843 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-08 12:20:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 12:20:49,843 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-08 12:20:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:20:49,843 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-08 12:20:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-08 12:20:49,844 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-08 12:20:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-08 12:20:49,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-08 12:20:49,989 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-08 12:20:49,995 INFO L225 Difference]: With dead ends: 339 [2022-04-08 12:20:49,995 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 12:20:49,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=111, Invalid=491, Unknown=2, NotChecked=46, Total=650 [2022-04-08 12:20:49,996 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:20:49,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 324 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 12:20:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 12:20:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-08 12:20:50,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:20:50,554 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-08 12:20:50,554 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-08 12:20:50,555 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-08 12:20:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:20:50,560 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-08 12:20:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-08 12:20:50,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:20:50,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:20:50,561 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-08 12:20:50,562 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-08 12:20:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:20:50,567 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-08 12:20:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-08 12:20:50,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:20:50,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:20:50,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:20:50,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:20:50,568 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-08 12:20:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-08 12:20:50,575 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-08 12:20:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:20:50,575 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-08 12:20:50,575 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-08 12:20:50,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-08 12:20:51,160 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-08 12:20:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-08 12:20:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 12:20:51,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:20:51,161 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-08 12:20:51,193 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-08 12:20:51,362 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-08 12:20:51,362 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:20:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:20:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-08 12:20:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:20:51,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287662930] [2022-04-08 12:20:51,362 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:20:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-08 12:20:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:20:51,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864807647] [2022-04-08 12:20:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:20:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:20:51,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:20:51,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057170816] [2022-04-08 12:20:51,378 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:20:51,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:20:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:20:51,380 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-08 12:20:51,409 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-08 12:20:51,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:20:51,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:20:51,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 12:20:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:20:51,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:20:51,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {29918#true} call ULTIMATE.init(); {29918#true} is VALID [2022-04-08 12:20:51,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {29918#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; {29918#true} is VALID [2022-04-08 12:20:51,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29918#true} {29918#true} #98#return; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {29918#true} call #t~ret8 := main(); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {29918#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; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {29918#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29918#true} {29918#true} #78#return; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L272 TraceCheckUtils]: 11: Hoare triple {29918#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29918#true} {29918#true} #80#return; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {29918#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; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L272 TraceCheckUtils]: 17: Hoare triple {29918#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29918#true} {29918#true} #82#return; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L272 TraceCheckUtils]: 22: Hoare triple {29918#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29918#true} {29918#true} #84#return; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {29918#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {29918#true} assume !!(#t~post6 < 5);havoc #t~post6; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {29918#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L272 TraceCheckUtils]: 32: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L272 TraceCheckUtils]: 37: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L272 TraceCheckUtils]: 42: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L272 TraceCheckUtils]: 47: Hoare triple {29918#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)); {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L272 TraceCheckUtils]: 55: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L272 TraceCheckUtils]: 60: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L272 TraceCheckUtils]: 65: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L272 TraceCheckUtils]: 70: Hoare triple {29918#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)); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-08 12:20:51,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-08 12:20:51,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-08 12:20:51,735 INFO L272 TraceCheckUtils]: 78: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:20:51,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {29918#true} ~cond := #in~cond; {30160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:20:51,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {30160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:20:51,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:20:51,736 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} {29918#true} #86#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,736 INFO L272 TraceCheckUtils]: 83: Hoare triple {30171#(= 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)); {29918#true} is VALID [2022-04-08 12:20:51,736 INFO L290 TraceCheckUtils]: 84: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,736 INFO L290 TraceCheckUtils]: 85: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,736 INFO L290 TraceCheckUtils]: 86: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,737 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,737 INFO L272 TraceCheckUtils]: 88: Hoare triple {30171#(= 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)); {29918#true} is VALID [2022-04-08 12:20:51,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,737 INFO L290 TraceCheckUtils]: 91: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,738 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,738 INFO L272 TraceCheckUtils]: 93: Hoare triple {30171#(= 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)); {29918#true} is VALID [2022-04-08 12:20:51,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:20:51,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:20:51,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:20:51,739 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,741 INFO L290 TraceCheckUtils]: 98: Hoare triple {30171#(= 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; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,741 INFO L290 TraceCheckUtils]: 99: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:20:51,742 INFO L272 TraceCheckUtils]: 101: Hoare triple {30171#(= 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)); {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:20:51,742 INFO L290 TraceCheckUtils]: 102: Hoare triple {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:20:51,742 INFO L290 TraceCheckUtils]: 103: Hoare triple {30233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29919#false} is VALID [2022-04-08 12:20:51,742 INFO L290 TraceCheckUtils]: 104: Hoare triple {29919#false} assume !false; {29919#false} is VALID [2022-04-08 12:20:51,743 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-08 12:20:51,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:21:03,108 INFO L290 TraceCheckUtils]: 104: Hoare triple {29919#false} assume !false; {29919#false} is VALID [2022-04-08 12:21:03,108 INFO L290 TraceCheckUtils]: 103: Hoare triple {30233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29919#false} is VALID [2022-04-08 12:21:03,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:03,109 INFO L272 TraceCheckUtils]: 101: Hoare triple {30171#(= 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)); {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:21:03,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,110 INFO L290 TraceCheckUtils]: 99: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,152 INFO L290 TraceCheckUtils]: 98: Hoare triple {30171#(= 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; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,153 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,153 INFO L290 TraceCheckUtils]: 96: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,153 INFO L290 TraceCheckUtils]: 95: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,153 INFO L290 TraceCheckUtils]: 94: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,153 INFO L272 TraceCheckUtils]: 93: Hoare triple {30171#(= 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)); {29918#true} is VALID [2022-04-08 12:21:03,154 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,154 INFO L290 TraceCheckUtils]: 91: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,154 INFO L290 TraceCheckUtils]: 90: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,154 INFO L290 TraceCheckUtils]: 89: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,154 INFO L272 TraceCheckUtils]: 88: Hoare triple {30171#(= 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)); {29918#true} is VALID [2022-04-08 12:21:03,155 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,155 INFO L272 TraceCheckUtils]: 83: Hoare triple {30171#(= 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)); {29918#true} is VALID [2022-04-08 12:21:03,155 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} {29918#true} #86#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 12:21:03,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:03,156 INFO L290 TraceCheckUtils]: 80: Hoare triple {30315#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:03,156 INFO L290 TraceCheckUtils]: 79: Hoare triple {29918#true} ~cond := #in~cond; {30315#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:21:03,156 INFO L272 TraceCheckUtils]: 78: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 73: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L272 TraceCheckUtils]: 70: Hoare triple {29918#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)); {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L272 TraceCheckUtils]: 65: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L272 TraceCheckUtils]: 60: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-08 12:21:03,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L272 TraceCheckUtils]: 55: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L272 TraceCheckUtils]: 47: Hoare triple {29918#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)); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L272 TraceCheckUtils]: 42: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L272 TraceCheckUtils]: 37: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L272 TraceCheckUtils]: 32: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {29918#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {29918#true} assume !!(#t~post6 < 5);havoc #t~post6; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {29918#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29918#true} {29918#true} #84#return; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L272 TraceCheckUtils]: 22: Hoare triple {29918#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29918#true} {29918#true} #82#return; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L272 TraceCheckUtils]: 17: Hoare triple {29918#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {29918#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; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29918#true} {29918#true} #80#return; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L272 TraceCheckUtils]: 11: Hoare triple {29918#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29918#true} {29918#true} #78#return; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {29918#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {29918#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; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {29918#true} call #t~ret8 := main(); {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29918#true} {29918#true} #98#return; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {29918#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; {29918#true} is VALID [2022-04-08 12:21:03,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {29918#true} call ULTIMATE.init(); {29918#true} is VALID [2022-04-08 12:21:03,161 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-08 12:21:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:21:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864807647] [2022-04-08 12:21:03,161 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:21:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057170816] [2022-04-08 12:21:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057170816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:21:03,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:21:03,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-08 12:21:03,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:21:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287662930] [2022-04-08 12:21:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287662930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:21:03,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:21:03,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:21:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486581411] [2022-04-08 12:21:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:21:03,162 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-08 12:21:03,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:21:03,162 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-08 12:21:03,212 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-08 12:21:03,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:21:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:21:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:21:03,213 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-08 12:21:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:03,987 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-08 12:21:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:21:03,987 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-08 12:21:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:21:03,988 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-08 12:21:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 12:21:03,988 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-08 12:21:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 12:21:03,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-08 12:21:04,027 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-08 12:21:04,033 INFO L225 Difference]: With dead ends: 341 [2022-04-08 12:21:04,034 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 12:21:04,034 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-08 12:21:04,034 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-08 12:21:04,034 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-08 12:21:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 12:21:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-08 12:21:04,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:21:04,632 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-08 12:21:04,633 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-08 12:21:04,633 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-08 12:21:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:04,638 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-08 12:21:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-08 12:21:04,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:04,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:04,639 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-08 12:21:04,640 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-08 12:21:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:04,645 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-08 12:21:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-08 12:21:04,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:04,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:04,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:21:04,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:21:04,646 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-08 12:21:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-08 12:21:04,653 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-08 12:21:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:21:04,653 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-08 12:21:04,653 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-08 12:21:04,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-08 12:21:05,305 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-08 12:21:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-08 12:21:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 12:21:05,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:21:05,306 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-08 12:21:05,324 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-08 12:21:05,506 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-08 12:21:05,506 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:21:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:21:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-08 12:21:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:05,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [792635860] [2022-04-08 12:21:05,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:21:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-08 12:21:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:21:05,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689615084] [2022-04-08 12:21:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:21:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:21:05,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:21:05,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770595741] [2022-04-08 12:21:05,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:21:05,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:21:05,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:21:05,517 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-08 12:21:05,518 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-08 12:21:05,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:21:05,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:21:05,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:21:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:21:05,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:21:05,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {32597#true} call ULTIMATE.init(); {32597#true} is VALID [2022-04-08 12:21:05,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {32597#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; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32605#(<= ~counter~0 0)} {32597#true} #98#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {32605#(<= ~counter~0 0)} call #t~ret8 := main(); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {32605#(<= ~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; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #78#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,963 INFO L272 TraceCheckUtils]: 11: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,965 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #80#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {32605#(<= ~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; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,966 INFO L272 TraceCheckUtils]: 17: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,967 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #82#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,968 INFO L272 TraceCheckUtils]: 22: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,969 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #84#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:05,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {32605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-08 12:21:05,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {32684#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-08 12:21:05,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {32684#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32684#(<= ~counter~0 1)} is VALID [2022-04-08 12:21:05,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {32684#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {32694#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,972 INFO L272 TraceCheckUtils]: 32: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,973 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #86#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,973 INFO L272 TraceCheckUtils]: 37: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,975 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #88#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,975 INFO L272 TraceCheckUtils]: 42: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,977 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #90#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,977 INFO L272 TraceCheckUtils]: 47: Hoare triple {32694#(<= ~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)); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,979 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #92#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {32694#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:05,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {32694#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {32764#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,980 INFO L272 TraceCheckUtils]: 55: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,982 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #86#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,982 INFO L272 TraceCheckUtils]: 60: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,984 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #88#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,984 INFO L272 TraceCheckUtils]: 65: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,985 INFO L290 TraceCheckUtils]: 67: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,985 INFO L290 TraceCheckUtils]: 68: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,986 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #90#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,986 INFO L272 TraceCheckUtils]: 70: Hoare triple {32764#(<= ~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)); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,987 INFO L290 TraceCheckUtils]: 73: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,988 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #92#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {32764#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:05,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {32764#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {32834#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,989 INFO L272 TraceCheckUtils]: 78: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,990 INFO L290 TraceCheckUtils]: 81: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,990 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #86#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,991 INFO L272 TraceCheckUtils]: 83: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,991 INFO L290 TraceCheckUtils]: 84: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,991 INFO L290 TraceCheckUtils]: 85: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,992 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #88#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,992 INFO L272 TraceCheckUtils]: 88: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,993 INFO L290 TraceCheckUtils]: 89: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,993 INFO L290 TraceCheckUtils]: 90: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,993 INFO L290 TraceCheckUtils]: 91: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,994 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #90#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,994 INFO L272 TraceCheckUtils]: 93: Hoare triple {32834#(<= ~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)); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,994 INFO L290 TraceCheckUtils]: 94: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,995 INFO L290 TraceCheckUtils]: 95: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,995 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #92#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,996 INFO L290 TraceCheckUtils]: 98: Hoare triple {32834#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,996 INFO L290 TraceCheckUtils]: 99: Hoare triple {32834#(<= ~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; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:05,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {32834#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32907#(<= |main_#t~post6| 4)} is VALID [2022-04-08 12:21:05,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {32907#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {32598#false} is VALID [2022-04-08 12:21:05,997 INFO L272 TraceCheckUtils]: 102: Hoare triple {32598#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32598#false} is VALID [2022-04-08 12:21:05,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {32598#false} ~cond := #in~cond; {32598#false} is VALID [2022-04-08 12:21:05,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {32598#false} assume 0 == ~cond; {32598#false} is VALID [2022-04-08 12:21:05,997 INFO L290 TraceCheckUtils]: 105: Hoare triple {32598#false} assume !false; {32598#false} is VALID [2022-04-08 12:21:05,997 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-08 12:21:05,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:21:06,351 INFO L290 TraceCheckUtils]: 105: Hoare triple {32598#false} assume !false; {32598#false} is VALID [2022-04-08 12:21:06,351 INFO L290 TraceCheckUtils]: 104: Hoare triple {32598#false} assume 0 == ~cond; {32598#false} is VALID [2022-04-08 12:21:06,351 INFO L290 TraceCheckUtils]: 103: Hoare triple {32598#false} ~cond := #in~cond; {32598#false} is VALID [2022-04-08 12:21:06,351 INFO L272 TraceCheckUtils]: 102: Hoare triple {32598#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32598#false} is VALID [2022-04-08 12:21:06,352 INFO L290 TraceCheckUtils]: 101: Hoare triple {32907#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {32598#false} is VALID [2022-04-08 12:21:06,352 INFO L290 TraceCheckUtils]: 100: Hoare triple {32834#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32907#(<= |main_#t~post6| 4)} is VALID [2022-04-08 12:21:06,352 INFO L290 TraceCheckUtils]: 99: Hoare triple {32834#(<= ~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; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {32834#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,353 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #92#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,353 INFO L290 TraceCheckUtils]: 96: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,354 INFO L290 TraceCheckUtils]: 95: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,354 INFO L272 TraceCheckUtils]: 93: Hoare triple {32834#(<= ~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)); {32597#true} is VALID [2022-04-08 12:21:06,354 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #90#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,354 INFO L290 TraceCheckUtils]: 91: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,354 INFO L290 TraceCheckUtils]: 90: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,355 INFO L272 TraceCheckUtils]: 88: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,355 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #88#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,355 INFO L272 TraceCheckUtils]: 83: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,356 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #86#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,356 INFO L272 TraceCheckUtils]: 78: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {32834#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,358 INFO L290 TraceCheckUtils]: 76: Hoare triple {32764#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-08 12:21:06,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {32764#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,359 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #92#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,359 INFO L272 TraceCheckUtils]: 70: Hoare triple {32764#(<= ~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)); {32597#true} is VALID [2022-04-08 12:21:06,359 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #90#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,360 INFO L272 TraceCheckUtils]: 65: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,360 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #88#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,360 INFO L272 TraceCheckUtils]: 60: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,361 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #86#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,361 INFO L272 TraceCheckUtils]: 55: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {32764#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {32694#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-08 12:21:06,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {32694#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,363 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #92#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,363 INFO L272 TraceCheckUtils]: 47: Hoare triple {32694#(<= ~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)); {32597#true} is VALID [2022-04-08 12:21:06,364 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #90#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,364 INFO L272 TraceCheckUtils]: 42: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,364 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #88#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L272 TraceCheckUtils]: 37: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #86#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,365 INFO L272 TraceCheckUtils]: 32: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {32694#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {32684#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-08 12:21:06,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {32684#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32684#(<= ~counter~0 1)} is VALID [2022-04-08 12:21:06,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {32684#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-08 12:21:06,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {32605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-08 12:21:06,368 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #84#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,368 INFO L272 TraceCheckUtils]: 22: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,368 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #82#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {32605#(<= ~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; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,369 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #80#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,370 INFO L272 TraceCheckUtils]: 11: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,370 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #78#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-08 12:21:06,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-08 12:21:06,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-08 12:21:06,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32597#true} is VALID [2022-04-08 12:21:06,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {32605#(<= ~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; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {32605#(<= ~counter~0 0)} call #t~ret8 := main(); {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32605#(<= ~counter~0 0)} {32597#true} #98#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {32597#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; {32605#(<= ~counter~0 0)} is VALID [2022-04-08 12:21:06,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {32597#true} call ULTIMATE.init(); {32597#true} is VALID [2022-04-08 12:21:06,372 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-08 12:21:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:21:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689615084] [2022-04-08 12:21:06,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:21:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770595741] [2022-04-08 12:21:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770595741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:21:06,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:21:06,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-08 12:21:06,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:21:06,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [792635860] [2022-04-08 12:21:06,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [792635860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:21:06,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:21:06,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:21:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833934455] [2022-04-08 12:21:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:21:06,373 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-08 12:21:06,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:21:06,374 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-08 12:21:06,433 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-08 12:21:06,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:21:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:06,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:21:06,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:21:06,434 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-08 12:21:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:07,251 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-08 12:21:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:21:07,251 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-08 12:21:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:21:07,251 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-08 12:21:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-08 12:21:07,252 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-08 12:21:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-08 12:21:07,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-08 12:21:07,334 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-08 12:21:07,340 INFO L225 Difference]: With dead ends: 349 [2022-04-08 12:21:07,340 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 12:21:07,341 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-08 12:21:07,341 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:21:07,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 177 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:21:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 12:21:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 12:21:07,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:21:07,912 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-08 12:21:07,913 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-08 12:21:07,913 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-08 12:21:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:07,918 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-08 12:21:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-08 12:21:07,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:07,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:07,919 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-08 12:21:07,920 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-08 12:21:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:07,925 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-08 12:21:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-08 12:21:07,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:07,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:07,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:21:07,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:21:07,926 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-08 12:21:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-08 12:21:07,937 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-08 12:21:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:21:07,937 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-08 12:21:07,937 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-08 12:21:07,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-08 12:21:08,585 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-08 12:21:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-08 12:21:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 12:21:08,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:21:08,586 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-08 12:21:08,602 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-08 12:21:08,787 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-08 12:21:08,787 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:21:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:21:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-08 12:21:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:08,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464467984] [2022-04-08 12:21:08,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:21:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-08 12:21:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:21:08,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651201804] [2022-04-08 12:21:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:21:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:21:08,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:21:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702258369] [2022-04-08 12:21:08,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:21:08,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:21:08,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:21:08,798 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-08 12:21:08,799 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-08 12:21:08,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:21:08,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:21:08,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 12:21:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:21:08,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:21:09,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {35312#true} call ULTIMATE.init(); {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {35312#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; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35312#true} {35312#true} #98#return; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {35312#true} call #t~ret8 := main(); {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {35312#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; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {35312#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35312#true} {35312#true} #78#return; {35312#true} is VALID [2022-04-08 12:21:09,793 INFO L272 TraceCheckUtils]: 11: Hoare triple {35312#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35312#true} {35312#true} #80#return; {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {35312#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; {35365#(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-08 12:21:09,794 INFO L272 TraceCheckUtils]: 17: Hoare triple {35365#(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)); {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,795 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35312#true} {35365#(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; {35365#(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-08 12:21:09,795 INFO L272 TraceCheckUtils]: 22: Hoare triple {35365#(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)); {35312#true} is VALID [2022-04-08 12:21:09,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,796 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35312#true} {35365#(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; {35365#(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-08 12:21:09,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {35365#(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; {35365#(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-08 12:21:09,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {35365#(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; {35365#(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-08 12:21:09,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {35365#(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; {35405#(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-08 12:21:09,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {35405#(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; {35405#(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-08 12:21:09,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {35405#(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; {35405#(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-08 12:21:09,798 INFO L272 TraceCheckUtils]: 32: Hoare triple {35405#(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)); {35312#true} is VALID [2022-04-08 12:21:09,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,798 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35312#true} {35405#(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; {35405#(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-08 12:21:09,798 INFO L272 TraceCheckUtils]: 37: Hoare triple {35405#(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)); {35312#true} is VALID [2022-04-08 12:21:09,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,799 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35312#true} {35405#(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; {35405#(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-08 12:21:09,799 INFO L272 TraceCheckUtils]: 42: Hoare triple {35405#(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)); {35312#true} is VALID [2022-04-08 12:21:09,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,800 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35312#true} {35405#(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; {35405#(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-08 12:21:09,800 INFO L272 TraceCheckUtils]: 47: Hoare triple {35405#(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)); {35312#true} is VALID [2022-04-08 12:21:09,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,801 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35312#true} {35405#(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; {35405#(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-08 12:21:09,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {35405#(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; {35475#(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-08 12:21:09,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {35475#(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; {35475#(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-08 12:21:09,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {35475#(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; {35475#(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-08 12:21:09,803 INFO L272 TraceCheckUtils]: 55: Hoare triple {35475#(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)); {35312#true} is VALID [2022-04-08 12:21:09,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,804 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35312#true} {35475#(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; {35475#(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-08 12:21:09,804 INFO L272 TraceCheckUtils]: 60: Hoare triple {35475#(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)); {35312#true} is VALID [2022-04-08 12:21:09,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,805 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35312#true} {35475#(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; {35475#(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-08 12:21:09,805 INFO L272 TraceCheckUtils]: 65: Hoare triple {35475#(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)); {35312#true} is VALID [2022-04-08 12:21:09,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,806 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35312#true} {35475#(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; {35475#(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-08 12:21:09,806 INFO L272 TraceCheckUtils]: 70: Hoare triple {35475#(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)); {35312#true} is VALID [2022-04-08 12:21:09,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,806 INFO L290 TraceCheckUtils]: 72: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,806 INFO L290 TraceCheckUtils]: 73: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,807 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35312#true} {35475#(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; {35475#(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-08 12:21:09,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {35475#(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; {35545#(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-08 12:21:09,808 INFO L290 TraceCheckUtils]: 76: Hoare triple {35545#(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; {35545#(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-08 12:21:09,808 INFO L290 TraceCheckUtils]: 77: Hoare triple {35545#(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; {35545#(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-08 12:21:09,808 INFO L272 TraceCheckUtils]: 78: Hoare triple {35545#(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)); {35312#true} is VALID [2022-04-08 12:21:09,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {35312#true} ~cond := #in~cond; {35558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:09,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {35558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:09,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:21:09,829 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} {35545#(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; {35569#(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-08 12:21:09,829 INFO L272 TraceCheckUtils]: 83: Hoare triple {35569#(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)); {35312#true} is VALID [2022-04-08 12:21:09,829 INFO L290 TraceCheckUtils]: 84: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,829 INFO L290 TraceCheckUtils]: 85: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,829 INFO L290 TraceCheckUtils]: 86: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,830 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35312#true} {35569#(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; {35569#(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-08 12:21:09,830 INFO L272 TraceCheckUtils]: 88: Hoare triple {35569#(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)); {35312#true} is VALID [2022-04-08 12:21:09,830 INFO L290 TraceCheckUtils]: 89: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,830 INFO L290 TraceCheckUtils]: 90: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,830 INFO L290 TraceCheckUtils]: 91: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,831 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {35312#true} {35569#(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; {35569#(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-08 12:21:09,831 INFO L272 TraceCheckUtils]: 93: Hoare triple {35569#(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)); {35312#true} is VALID [2022-04-08 12:21:09,831 INFO L290 TraceCheckUtils]: 94: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-08 12:21:09,831 INFO L290 TraceCheckUtils]: 95: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-08 12:21:09,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-08 12:21:09,832 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {35312#true} {35569#(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; {35569#(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-08 12:21:09,832 INFO L290 TraceCheckUtils]: 98: Hoare triple {35569#(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); {35569#(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-08 12:21:09,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {35569#(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; {35621#(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-08 12:21:09,834 INFO L290 TraceCheckUtils]: 100: Hoare triple {35621#(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; {35621#(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-08 12:21:09,835 INFO L290 TraceCheckUtils]: 101: Hoare triple {35621#(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; {35621#(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-08 12:21:09,835 INFO L290 TraceCheckUtils]: 102: Hoare triple {35621#(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); {35631#(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-08 12:21:09,836 INFO L272 TraceCheckUtils]: 103: Hoare triple {35631#(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)); {35635#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:21:09,836 INFO L290 TraceCheckUtils]: 104: Hoare triple {35635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:21:09,836 INFO L290 TraceCheckUtils]: 105: Hoare triple {35639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35313#false} is VALID [2022-04-08 12:21:09,836 INFO L290 TraceCheckUtils]: 106: Hoare triple {35313#false} assume !false; {35313#false} is VALID [2022-04-08 12:21:09,837 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-08 12:21:09,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:21:19,149 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:21:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:21:19,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651201804] [2022-04-08 12:21:19,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:21:19,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702258369] [2022-04-08 12:21:19,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702258369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:21:19,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:21:19,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 12:21:19,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:21:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464467984] [2022-04-08 12:21:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464467984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:21:19,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:21:19,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:21:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548870802] [2022-04-08 12:21:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:21:19,247 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-08 12:21:19,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:21:19,247 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-08 12:21:19,323 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-08 12:21:19,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:21:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:21:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 12:21:19,324 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-08 12:21:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:22,024 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-08 12:21:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:21:22,024 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-08 12:21:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:21:22,025 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-08 12:21:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-08 12:21:22,026 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-08 12:21:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-08 12:21:22,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-08 12:21:22,157 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-08 12:21:22,164 INFO L225 Difference]: With dead ends: 369 [2022-04-08 12:21:22,164 INFO L226 Difference]: Without dead ends: 366 [2022-04-08 12:21:22,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-08 12:21:22,164 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:21:22,164 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.8s Time] [2022-04-08 12:21:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-08 12:21:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-08 12:21:22,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:21:22,766 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-08 12:21:22,767 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-08 12:21:22,767 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-08 12:21:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:22,773 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-08 12:21:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-08 12:21:22,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:22,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:22,774 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-08 12:21:22,774 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-08 12:21:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:21:22,780 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-08 12:21:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-08 12:21:22,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:21:22,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:21:22,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:21:22,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:21:22,782 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-08 12:21:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-08 12:21:22,789 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-08 12:21:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:21:22,789 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-08 12:21:22,789 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-08 12:21:22,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-08 12:21:23,474 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-08 12:21:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-08 12:21:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 12:21:23,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:21:23,475 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-08 12:21:23,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 12:21:23,675 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-08 12:21:23,675 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:21:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:21:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-08 12:21:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:21:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132057046] [2022-04-08 12:21:23,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:21:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-08 12:21:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:21:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939590804] [2022-04-08 12:21:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:21:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:21:23,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:21:23,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586609767] [2022-04-08 12:21:23,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:21:23,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:21:23,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:21:23,688 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-08 12:21:23,690 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-08 12:21:23,795 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:21:23,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 12:21:23,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 12:21:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 12:21:23,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 12:21:23,885 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 12:21:23,885 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 12:21:23,887 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 12:21:23,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 12:21:24,092 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-08 12:21:24,095 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-08 12:21:24,097 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 12:21:24,110 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-08 12:21:24,111 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 12:21:24,112 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 12:21:24,112 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-08 12:21:24,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:21:24 BoogieIcfgContainer [2022-04-08 12:21:24,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 12:21:24,113 INFO L158 Benchmark]: Toolchain (without parser) took 366022.48ms. Allocated memory was 164.6MB in the beginning and 251.7MB in the end (delta: 87.0MB). Free memory was 113.5MB in the beginning and 215.1MB in the end (delta: -101.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:21:24,113 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 164.6MB. Free memory was 130.0MB in the beginning and 129.9MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:21:24,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.32ms. Allocated memory was 164.6MB in the beginning and 209.7MB in the end (delta: 45.1MB). Free memory was 113.4MB in the beginning and 184.8MB in the end (delta: -71.4MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-08 12:21:24,114 INFO L158 Benchmark]: Boogie Preprocessor took 37.13ms. Allocated memory is still 209.7MB. Free memory was 184.8MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 12:21:24,114 INFO L158 Benchmark]: RCFGBuilder took 326.27ms. Allocated memory is still 209.7MB. Free memory was 183.2MB in the beginning and 170.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 12:21:24,114 INFO L158 Benchmark]: TraceAbstraction took 365442.80ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 169.5MB in the beginning and 215.1MB in the end (delta: -45.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:21:24,114 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.15ms. Allocated memory is still 164.6MB. Free memory was 130.0MB in the beginning and 129.9MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.32ms. Allocated memory was 164.6MB in the beginning and 209.7MB in the end (delta: 45.1MB). Free memory was 113.4MB in the beginning and 184.8MB in the end (delta: -71.4MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.13ms. Allocated memory is still 209.7MB. Free memory was 184.8MB in the beginning and 183.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 326.27ms. Allocated memory is still 209.7MB. Free memory was 183.2MB in the beginning and 170.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 365442.80ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 169.5MB in the beginning and 215.1MB in the end (delta: -45.5MB). There was no memory consumed. 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: 365.4s, OverallIterations: 27, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 712 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 4873 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3626 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4008 IncrementalHoareTripleChecker+Invalid, 4496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 1247 mSDtfsCounter, 4008 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3065 GetRequests, 2777 SyntacticMatches, 26 SemanticMatches, 262 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=26, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s 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-08 12:21:24,160 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...